Approximating the diameter of planar graphs in near linear time

Oren Weimann; Raphael Yuster

doi:10.1145/2764910

Approximating the diameter of planar graphs in near linear time

Research output: Contribution to journal › Article › peer-review

Abstract

We present a (1 + ε)-approximation algorithm running in O(f(ε). nlog⁴_n) 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	https://doi.org/10.1145/2764910
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)

Access to Document

10.1145/2764910

Cite this

@article{a5a16e9ce8384dd5ac211833b5855fde,

title = "Approximating the diameter of planar graphs in near linear time",

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.",

keywords = "All pairs shortest paths, Diameter, Distance oracles, Planar graphs",

author = "Oren Weimann and Raphael Yuster",

note = "Publisher Copyright: {\textcopyright} 2015 ACM.",

year = "2015",

month = nov,

doi = "10.1145/2764910",

language = "English",

volume = "12",

journal = "ACM Transactions on Algorithms",

issn = "1549-6325",

publisher = "Association for Computing Machinery (ACM)",

number = "1",

}

TY - JOUR

T1 - Approximating the diameter of planar graphs in near linear time

AU - Weimann, Oren

AU - Yuster, Raphael

PY - 2015/11

Y1 - 2015/11

N2 - 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.

AB - 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.

KW - All pairs shortest paths

KW - Diameter

KW - Distance oracles

KW - Planar graphs

UR - https://www.scopus.com/pages/publications/84947915068

U2 - 10.1145/2764910

DO - 10.1145/2764910

M3 - Article

AN - SCOPUS:84947915068

SN - 1549-6325

VL - 12

JO - ACM Transactions on Algorithms

JF - ACM Transactions on Algorithms

IS - 1

M1 - 12

ER -

Approximating the diameter of planar graphs in near linear time

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this