Approximating the Diameter of Planar Graphs in Near Linear Time

We present a (1+e)-approximation algorithm running in O(f(e) ·n log4n) time for finding the diameter of an undirected planar graph with n vertices and with non-negative edge lengths.

[1]  Mikkel Thorup.  Compact oracles for reachability and approximate distances in planar digraphs , 2004, JACM.

[2]  Donald B. Johnson,et al.  Efficient Algorithms for Shortest Paths in Sparse Networks , 1977, J. ACM.

[3]  Piotr Berman,et al.  Faster Approximation of Distances in Graphs , 2007, WADS.

[4]  Stephan Olariu,et al.  A simple linear-time algorithm for computing the center of an interval graph , 1990, Int. J. Comput. Math..

[5]  Yijie Han,et al.  An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths , 2012, SWAT.

[6]  Philip N. Klein,et al.  Faster Shortest-Path Algorithms for Planar Graphs , 1997, J. Comput. Syst. Sci..

[7]  Arthur M. Farley,et al.  Computation of the center and diameter of outerplanar graphs , 1980, Discret. Appl. Math..

[8]  Feodor F. Dragan,et al.  LexBFS-Orderings and Power of Graphs , 1996, WG.

[9]  Christian Wulff-Nilsen.  Wiener Index, Diameter, and Stretch Factor of a Weighted Planar Graph in Subquadratic Time , 2015 .

[10]  Seth Pettie,et al.  A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphs , 2002, ICALP.

[11]  Karlis Freivalds,et al.  Fast and Simple Approximation of the Diameter and Radius of a Graph , 2006, WEA.

[12]  Feodor F. Dragan,et al.  A Linear-Time Algorithm for Finding a Central Vertex of a Chordal Graph , 1994, ESA.

[13]  Philip N. Klein,et al.  Multiple-source shortest paths in planar graphs , 2005, SODA '05.

[14]  David Hartvigsen,et al.  The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs , 1994, SIAM J. Discret. Math..

[15]  Piotr Indyk,et al.  Fast estimation of diameter and shortest paths (without matrix multiplication) , 1996, SODA '96.

[16]  Greg N. Frederickson,et al.  Fast Algorithms for Shortest Paths in Planar Graphs, with Applications , 1987, SIAM J. Comput..

[17]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[18]  Philip N. Klein,et al.  Preprocessing an undirected planar network to enable fast approximate distance queries , 2002, SODA '02.

[19]  David Eppstein,et al.  The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems , 1994, GD.