DOE OSTI · code-984
Two linear time, low overhead algorithms for graph layout
Abstract
The software comprises two algorithms designed to perform a 2D layout of a graph structure in time linear with respect to the vertices and edges in the graph, whereas most other layout algorithms have a running time that is quadratic with respect to the number of vertices or greater. Although these layout algorithms run in a fraction of the time as their competitors, they provide competitive results when applied to most real-world graphs. These algorithms also have a low constant running time and small memory footprint, making them useful for small to large graphs.
Keep this discovery
Explore connections, maps & timelines
Wylie, Brian, Baumes, Jeff. 2008-01-10. Two linear time, low overhead algorithms for graph layout. https://doi.org/10.11578/dc.20171025.1130. https://searchnasa.com/record/osti%3Acode-984/two-linear-time-low-overhead-algorithms-for-graph-layout
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Search NASA by Indiciae: BibTeX · RIS.