Shortest paths in directed planar graphs with negative lengths: A linear-space O(n log2 n)-time algorithm

Philip N. Klein; Shay Mozes; Oren Weimann

doi:10.1145/1721837.1721846

Shortest paths in directed planar graphs with negative lengths: A linear-space O(n log² n)-time algorithm

Philip N. Klein, Shay Mozes, Oren Weimann

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

Abstract

We give an O(n log² n)-time, linear-space algorithm that, given a directed planar graph with positive and negative arc-lengths, and given a node s, finds the distances from s to all nodes.

Original language	English
Article number	30
Journal	ACM Transactions on Algorithms
Volume	6
Issue number	2
DOIs	https://doi.org/10.1145/1721837.1721846
State	Published - 1 Mar 2010
Externally published	Yes

Keywords

Monge
Planar graphs
Replacement paths
Shortest paths

ASJC Scopus subject areas

Mathematics (miscellaneous)

Access to Document

10.1145/1721837.1721846

Cite this

@article{141c0c724ad3484188210169b352aca0,

title = "Shortest paths in directed planar graphs with negative lengths: A linear-space O(n log2 n)-time algorithm",

abstract = "We give an O(n log2 n)-time, linear-space algorithm that, given a directed planar graph with positive and negative arc-lengths, and given a node s, finds the distances from s to all nodes.",

keywords = "Monge, Planar graphs, Replacement paths, Shortest paths",

author = "Klein, \{Philip N.\} and Shay Mozes and Oren Weimann",

year = "2010",

month = mar,

day = "1",

doi = "10.1145/1721837.1721846",

language = "English",

volume = "6",

journal = "ACM Transactions on Algorithms",

issn = "1549-6325",

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

number = "2",

}

TY - JOUR

T1 - Shortest paths in directed planar graphs with negative lengths

T2 - A linear-space O(n log2 n)-time algorithm

AU - Klein, Philip N.

AU - Mozes, Shay

AU - Weimann, Oren

PY - 2010/3/1

Y1 - 2010/3/1

N2 - We give an O(n log2 n)-time, linear-space algorithm that, given a directed planar graph with positive and negative arc-lengths, and given a node s, finds the distances from s to all nodes.

AB - We give an O(n log2 n)-time, linear-space algorithm that, given a directed planar graph with positive and negative arc-lengths, and given a node s, finds the distances from s to all nodes.

KW - Monge

KW - Planar graphs

KW - Replacement paths

KW - Shortest paths

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

U2 - 10.1145/1721837.1721846

DO - 10.1145/1721837.1721846

M3 - Article

AN - SCOPUS:77950798339

SN - 1549-6325

VL - 6

JO - ACM Transactions on Algorithms

JF - ACM Transactions on Algorithms

IS - 2

M1 - 30

ER -