skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: 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.

Authors:
;
Publication Date:
Research Org.:
Sandia National Laboratories (SNL), Albuquerque, NM, and Livermore, CA (United States)
Sponsoring Org.:
USDOE
OSTI Identifier:
1252717
Report Number(s):
TLT/LOA; 002238MLTPL00
DOE Contract Number:  
AC04-94AL85000
Resource Type:
Software
Software Revision:
00
Software Package Number:
002238
Software Package Contents:
Open Source Software package available from Sandia National Laboratory at the following URL: http://www.vtk.org/
Software CPU:
MLTPL
Open Source:
Yes
Source Code Available:
Yes
Related Software:
VTK
Country of Publication:
United States

Citation Formats

Wylie, Brian, and Baumes, Jeff. Two linear time, low overhead algorithms for graph layout. Computer software. https://www.osti.gov//servlets/purl/1252717. Vers. 00. USDOE. 10 Jan. 2008. Web.
Wylie, Brian, & Baumes, Jeff. (2008, January 10). Two linear time, low overhead algorithms for graph layout (Version 00) [Computer software]. https://www.osti.gov//servlets/purl/1252717.
Wylie, Brian, and Baumes, Jeff. Two linear time, low overhead algorithms for graph layout. Computer software. Version 00. January 10, 2008. https://www.osti.gov//servlets/purl/1252717.
@misc{osti_1252717,
title = {Two linear time, low overhead algorithms for graph layout, Version 00},
author = {Wylie, Brian and Baumes, Jeff},
abstractNote = {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.},
url = {https://www.osti.gov//servlets/purl/1252717},
doi = {},
url = {https://www.osti.gov/biblio/1252717}, year = {Thu Jan 10 00:00:00 EST 2008},
month = {Thu Jan 10 00:00:00 EST 2008},
note =
}