Abstract
We present a (1 + ε)-approximation algorithm running in O(f(ε). nlog4n) time for finding the diameter of an undirected planar graph with n vertices and with nonnegative edge lengths.
Original language | English |
---|---|
Article number | 12 |
Journal | ACM Transactions on Algorithms |
Volume | 12 |
Issue number | 1 |
DOIs | |
State | Published - Nov 2015 |
Bibliographical note
Publisher Copyright:© 2015 ACM.
Keywords
- All pairs shortest paths
- Diameter
- Distance oracles
- Planar graphs
ASJC Scopus subject areas
- Mathematics (miscellaneous)