On the dilation spectrum of paths, cycles, and trees
DOI10.1016/J.COMGEO.2009.03.004zbMATH Open1200.05229OpenAlexW2059932006MaRDI QIDQ833719FDOQ833719
Authors: Rolf Klein, Christian Knauer, Giri Narasimhan, Michiel Smid 
Publication date: 14 August 2009
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2009.03.004
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Introduction to algorithms
- \(\epsilon\)-nets and simplex range queries
- The geometry of graphs and some of its algorithmic applications
- Geometric Spanner Networks
- Title not available (Why is that?)
- Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
- Graph spanners
- Computing Geometric Minimum-Dilation Graphs Is NP-Hard
- Algorithms for graphs of bounded treewidth via orthogonal range searching
- Computing a minimum-dilation spanning tree is NP-hard
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- Title not available (Why is that?)
- Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D
- Approximating the Stretch Factor of Euclidean Graphs
- Improving the Stretch Factor of a Geometric Network by Edge Augmentation
- Computing the Maximum Detour of a Plane Graph in Subquadratic Time
- Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces
Cited In (3)
This page was built for publication: On the dilation spectrum of paths, cycles, and trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q833719)
