SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding

DOI10.1007/978-3-540-70904-6_5MaRDI QIDQ3595496zbMATH OpenOpenAlexFDO

Authors Malik Magdon-Ismail, Eli Bocek-Rivele, Ali Çivril

Publication date 28 August 2007

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70904-6_5

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Graph Drawing
• On spectral graph drawing
• Drawing graphs by eigenvectors: theory and practice
• scientific article; zbMATH DE number 1974121
• Graph Drawing by High-Dimensional Embedding

Cited in

(3)

• An Experimental Study on Distance-Based Graph Drawing
• Graph Drawing
• On spectral graph drawing

This page was built for publication: SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3595496)