Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces

DOI10.1007/978-3-540-92182-0_67zbMath1183.68432OpenAlexW1584607632MaRDI QIDQ3597878

Christian Wulff-Nilsen, Jun Luo

Publication date: 29 January 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92182-0_67

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Connectivity (05C40)

Related Items (8)

On the dilation spectrum of paths, cycles, and trees ⋮ Fast Algorithms for Diameter-Optimally Augmenting Paths ⋮ Impact of the topology of urban streets on mobility optimization ⋮ Minimizing the continuous diameter when augmenting a geometric tree with a shortcut ⋮ Fast Algorithms for Diameter-Optimally Augmenting Paths and Trees ⋮ Computing optimal shortcuts for networks ⋮ Computing the dilation of edge-augmented graphs in metric spaces ⋮ Shortcut sets for the locus of plane Euclidean networks

This page was built for publication: Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces