A linear-space algorithm for distance preserving graph embedding
From MaRDI portal
Publication:1005326
DOI10.1016/j.comgeo.2008.06.004zbMath1169.05378OpenAlexW2030723399MaRDI QIDQ1005326
Prosenjit Bose, Stefanie Wuhrer, Paz Carmi, Anil Maheshwari, Tetsuo Asano, Chang Shu, Michiel H. M. Smid
Publication date: 9 March 2009
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://nrc-publications.canada.ca/eng/view/accepted/?id=f72c3335-8c52-4d96-88d6-ab8837810ddd
Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the limited memory BFGS method for large scale optimization
- Clustering to minimize the maximum intercluster distance
- Modern multidimensional scaling: theory and applications
- POSTURE INVARIANT CORRESPONDENCE OF INCOMPLETE TRIANGULAR MANIFOLDS
- Multigrid multidimensional scaling
- Computing geodesic paths on manifolds
- Low-dimensional embedding with extra information
- Adding a point to vector diagrams in multivariate analysis