Approximating the Diameter of Planar Graphs in Near Linear Time

Details Approximating the Diameter of Planar Graphs in Near Linear Time Approximating the Diameter of Planar Graphs in Near Linear Time

2011-12-05

arxiv.org/abs/1112.1116v2

Computer Science

Data Structures and Algorithms

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

Approximating the Diameter of Planar Graphs in Near Linear Time does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Approximating the Diameter of Planar Graphs in Near Linear Time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximating the Diameter of Planar Graphs in Near Linear Time will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-379994