Two linear time, low overhead algorithms for graph layout
Brian Wylie, Jeff Baumes · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · 2017
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.