Many distances in planar graphs

DOI10.1145/1109557.1109691MaRDI QIDQ5901136zbMATH OpenOpenAlexFDO

Authors S. 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

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

Cited in

(7)

• Linear-space approximate distance oracles for planar, bounded-genus and minor-free graphs
• Shortest paths avoiding forbidden subpaths
• Exact distance oracles for planar graphs
• Minimum Cuts in Surface Graphs
• Many distances in planar graphs
• Computing the shortest essential cycle
• Splitting (complicated) surfaces is hard

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

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