Graph drawing by high-dimensional embedding

DOI10.1007/3-540-36151-0_20MaRDI QIDQ4422277zbMATH OpenFDO

Authors David Harel, Yehuda Koren

Publication date 3 September 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2528/25280207.htm

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 by High-Dimensional Embedding
• A multi-dimensional approach to force-directed layouts of large graphs
• A multi-dimensional approach to force-directed layouts of large graphs
• Graph Drawing
• Graph Drawing

Cited in

(15)

• Data envelopment analysis application in sustainability: the origins, development and future directions
• One-dimensional layout optimization, with applications to graph drawing by axis separation
• Graph Drawing by High-Dimensional Embedding
• SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding
• An Experimental Study on Distance-Based Graph Drawing
• Drawing Big Graphs Using Spectral Sparsification
• scientific article; zbMATH DE number 6961636 (Why is no real title available?)
• Graph drawing by classical multidimensional scaling: new perspectives
• Graph Drawing via Gradient Descent, (GD)^2
• Parallel transport unfolding: a connection-based manifold learning approach
• Graph Drawing
• Generalizing geometric graphs
• Graph Drawing
• Drawing graphs by eigenvectors: theory and practice
• Complex systems: features, similarity and connectivity

This page was built for publication: Graph drawing by high-dimensional embedding

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