Many distances in planar graphs

DOI10.1145/1109557.1109691zbMath1192.05036OpenAlexW4254923572MaRDI QIDQ5901136

Sergio Cabello

Publication date: 16 August 2010

Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.348.4999

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Distance in graphs (05C12)

Related Items (7)

Minimum Cuts in Surface Graphs ⋮ Shortest paths avoiding forbidden subpaths ⋮ Computing the shortest essential cycle ⋮ Splitting (complicated) surfaces is hard ⋮ Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs ⋮ Many distances in planar graphs ⋮ Unnamed Item

This page was built for publication: Many distances in planar graphs