Results 1 
2 of
2
ACE: A Fast Multiscale Eigenvector Computation for Drawing Huge Graphs
, 2002
"... We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE finds an optimal drawing by minimizing a quadratic energy function due to Hall, using a novel algebraic multigrid technique. The algorithm exhibits ..."
Abstract

Cited by 62 (13 self)
 Add to MetaCart
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE finds an optimal drawing by minimizing a quadratic energy function due to Hall, using a novel algebraic multigrid technique. The algorithm exhibits an improvement of something like two orders of magnitude over the fastest algorithms we are aware of; it draws graphs of a million nodes in less than a minute. Moreover, the algorithm can deal with more general entities, such as graphs with masses and negative weights (to be defined in the text), and it appears to be applicable outside of graph drawing too.
Drawing Huge Graphs by Algebraic Multigrid Optimization. Multiscale Modeling and Simulation
, 2003
"... Abstract. We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits a vast improvement over the fastest algorithms we are currently aware of; using a serial PC, it draws graphs of millions of node ..."
Abstract

Cited by 30 (3 self)
 Add to MetaCart
Abstract. We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits a vast improvement over the fastest algorithms we are currently aware of; using a serial PC, it draws graphs of millions of nodes in less than a minute. ACE finds an optimal drawing by minimizing a quadratic energy function. The minimization problem is expressed as a generalized eigenvalue problem, which is solved rapidly using a novel algebraic multigrid technique. The same generalized eigenvalue problem seems to come up also in other fields, hence ACE appears to be applicable outside graph drawing too.