SDE: Graph drawing using spectral distance embedding

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3843 LNCS, Issue , 2006, Pages 512-513

  Civril, Ali ^a   Magdon Ismail, Malik ^a   Bocek Rivele, Eli ^a  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTANCE EMBEDDING; GRAPH DRAWING ALGORITHMS; NODE DENSITIES; SPECTRAL DECOMPOSITION;

ALGORITHMS; COMPUTATION THEORY; GRAPHIC METHODS; POLYNOMIAL APPROXIMATION;

GRAPH THEORY;

EID: 33745675729     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11618058_48     Document Type: Conference Paper

References (4)

1. A. Civril, M. Magdon-Ismail, and E. B. Rivele. SDE: Graph drawing using spectral distance embedding. Technical report, Rensselaer Polytechnic Institute, 2005.
2. D. Harel and Y. Koren. Graph drawing by high-dimensional embedding. In GD02, LNCS. Springer-Verlag, 2002.
3. Y. Koren, D. Harel, and L. Carmel. Drawing graphs by algebraic multigrid optimization. Multiscale Modeling and Simulation, 1(4):645-673, 2003. SIAM.
4. I. G. Tollis, G. D. Battista, P. Eades, and R. Tamassia. Graph. Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, 1999.