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 realworld 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
 Sponsoring Org.:
 USDOE
 OSTI Identifier:
 1252717
 Report Number(s):
 TLT/LOA; 002238MLTPL00
 DOE Contract Number:
 AC0494AL85000
 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 realworld 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 = {},
year = 2008,
month = 1,
note =
}


Optimal graph algorithms on a fixedsize linear array
Parallel algorithms for computing the minimum spanning tree of a weighted undirected graph, and the bridges and articulation points of an undirected graphs on a fixedsize linear array of processors are presented. For a graph of n vertices, the algorithms operate on a linear array of rho processors and require O(n/sup 2//rho) time for all rho, 1 less than or equal to rho  n. In particular, using n processors the algorithms require O(n) time which is optimal on this model. The paper describes two approaches to limit the communication requirements for solving the problems. The first is a divideandconquermore » 
Comparing Algorithms for Graph Isomorphism Using Discrete and ContinuousTime Quantum Random Walks
Berry and Wang [Phys. Rev. A 83, 042317 (2011)] show numerically that a discretetime quan tum random walk of two noninteracting particles is able to distinguish some nonisomorphic strongly regular graphs from the same family. Here we analytically demonstrate how it is possible for these walks to distinguish such graphs, while continuoustime quantum walks of two noninteracting parti cles cannot. We show analytically and numerically that even singleparticle discretetime quantum random walks can distinguish some strongly regular graphs, though not as many as twoparticle noninteracting discretetime walks. Additionally, we demonstrate how, given the same quantum random walk, subtle di erencesmore »Cited by 8 
Parallel supercomputing: Advanced methods, algorithms, and software for largescale linear and nonlinear problems. Final report, August 15, 1993February 28, 1996
This report gives a quick description of progress on methods, algorithms and software for largescale parallel supercomputer applications. Focus is on largescale applications of interest to DOE such as coupled viscous flow and heat or mass transport, and energyrelated applications such as 3D petroleum and gas reservoir simulations on massively parallel systems. The interdisciplinary collaboration has been effective since it enhances the development of new iterative schemes for complex problems important to DOE: for example, significant advanced were made with modified forms of generalized gradient and multigrid methods for viscous flow and reservoir problems. 
Preconditioned conjugate gradient algorithms and software for solving large sparse linear systems
The classical form of the conjugate gradient method (CG method), developed by Hestenes and Stiefel, for solving the linear system Au = b is applicable when the coefficient matrix A is symmetric and positive definite (SPD). In this paper we consider various alternative forms of the CG method as well as generalizations to cases where A is not necessarily SPD. This analysis includes the ''preconditioned conjugate gradient method'' which is equivalent to conjugate gradient acceleration of a basic iterative method corresponding to a preconditioned system. Both the symmetrizable case and the nonsymmetrizable case are considered. For the nonsymmetrizable case theremore »
To initiate an order for this software, request consultation services, or receive further information, fill out the request form below. You may also reach us by email at: .
OSTI staff will begin to process an order for scientific and technical software once the payment and signed site license agreement are received. If the forms are not in order, OSTI will contact you. No further action will be taken until all required information and/or payment is received. Orders are usually processed within three to five business days.