Approximating the Diameter of Planar Graphs in Near Linear Time

DOI10.1007/978-3-642-39206-1_70zbMath1336.68303arXiv1112.1116OpenAlexW2568001717MaRDI QIDQ5326614

Raphael Yuster, Oren Weimann

Publication date: 6 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.1116

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (4)

Constant query time \((1 + \epsilon)\)-approximate distance oracle for planar graphs ⋮ Unnamed Item ⋮ Computing Giant Graph Diameters ⋮ Faster Approximate Diameter and Distance Oracles in Planar Graphs

This page was built for publication: Approximating the Diameter of Planar Graphs in Near Linear Time