Approximating the Diameter of Planar Graphs in Near Linear Time

preprint2013arXivOpen access

We present a $(1+ε)$ -approximation algorithm running in $O(f(ε)\cdot n \log^4 n)$ time for finding the diameter of an undirected planar graph with non-negative edge lengths.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

Approximating the Diameter of Planar Graphs in Near Linear Time

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0