Skip to main content
Conference Proceedings

Approximating the diameter of planar graphs in near linear time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2013) 7965 LNCS(PART 1) 828-839
DOI: 10.1007/978-3-642-39206-1_70
3Citations
Citations of this article
28Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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

Cite

CITATION STYLE

APA

Weimann, O., & Yuster, R. (2013). Approximating the diameter of planar graphs in near linear time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7965 LNCS, pp. 828–839). https://doi.org/10.1007/978-3-642-39206-1_70

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free