Planar graphs, negative weight edges, shortest paths, and near linear time

Jittat Fakcharoenphol; Satish Rao

doi:10.1016/j.jcss.2005.05.007

Planar graphs, negative weight edges, shortest paths, and near linear time

Journal of Computer and System Sciences ◽

10.1016/j.jcss.2005.05.007 ◽

2006 ◽

Vol 72 (5) ◽

pp. 868-889 ◽

Cited By ~ 66

Author(s):

Jittat Fakcharoenphol ◽

Satish Rao

Keyword(s):

Planar Graphs ◽

Linear Time ◽

Shortest Paths ◽

Negative Weight

Download Full-text

Planar graphs, negative weight edges, shortest paths, and near linear time

Proceedings 42nd IEEE Symposium on Foundations of Computer Science ◽

10.1109/sfcs.2001.959897 ◽

2001 ◽

Cited By ~ 29

Author(s):

J. Fakcharoenphol ◽

S. Rao

Keyword(s):

Planar Graphs ◽

Linear Time ◽

Shortest Paths ◽

Negative Weight

Download Full-text

Shortest Paths in Planar Graphs with Negative Weight Edges

Encyclopedia of Algorithms ◽

10.1007/978-1-4939-2864-4_372 ◽

2016 ◽

pp. 1971-1974

Author(s):

Jittat Fakcharoenphol ◽

Satish Rao

Keyword(s):

Planar Graphs ◽

Shortest Paths ◽

Negative Weight

Download Full-text

Shortest Paths in Planar Graphs with Negative Weight Edges

Encyclopedia of Algorithms ◽

10.1007/978-0-387-30162-4_372 ◽

2008 ◽

pp. 838-841

Author(s):

Jittat Fakcharoenphol ◽

Satish Rao

Keyword(s):

Planar Graphs ◽

Shortest Paths ◽

Negative Weight

Download Full-text

Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs

Proceedings of the 45th annual ACM symposium on Symposium on theory of computing - STOC '13 ◽

10.1145/2488608.2488702 ◽

2013 ◽

Cited By ~ 3

Author(s):

David Eisenstat ◽

Philip N. Klein

Keyword(s):

Planar Graphs ◽

Linear Time ◽

Shortest Paths ◽

Multiple Source ◽

Unit Weight ◽

Linear Time Algorithms

Download Full-text

Shortest Paths in Planar Graphs with Negative Weight Edges, 2001; Fakcharoenphol, Rao

10.1007/springerreference_57891 ◽

2011 ◽

Keyword(s):

Planar Graphs ◽

Shortest Paths ◽

Negative Weight

Download Full-text

Linear-Time Succinct Encodings of Planar Graphs via Canonical Orderings

SIAM Journal on Discrete Mathematics ◽

10.1137/s0895480197325031 ◽

1999 ◽

Vol 12 (3) ◽

pp. 317-325 ◽

Cited By ~ 28

Author(s):

Xin He ◽

Ming-Yang Kao ◽

Hsueh-I Lu

Keyword(s):

Planar Graphs ◽

Linear Time

Download Full-text

A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs

Graph-Theoretic Concepts in Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-40064-8_27 ◽

2000 ◽

pp. 290-301 ◽

Cited By ~ 3

Author(s):

Sayaka Nagai ◽

Shin-ichi Nakano

Keyword(s):

Planar Graphs ◽

Spanning Trees ◽

Linear Time ◽

Time Algorithm ◽

Linear Time Algorithm ◽

Independent Spanning Trees

Download Full-text

An Efficient Oracle for Counting Shortest Paths in Planar Graphs

Algorithmic Aspects in Information and Management - Lecture Notes in Computer Science ◽

10.1007/978-3-030-93176-6_35 ◽

2021 ◽

pp. 406-417

Author(s):

Ye Gong ◽

Qian-Ping Gu

Keyword(s):

Planar Graphs ◽

Shortest Paths

Download Full-text

Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs

Discrete Applied Mathematics ◽

10.1016/j.dam.2018.08.027 ◽

2019 ◽

Vol 257 ◽

pp. 186-205

Author(s):

Qian-Ping Gu ◽

Gengchun Xu

Keyword(s):

Approximation Algorithm ◽

Time Constant ◽

Planar Graphs ◽

Linear Time ◽

Constant Factor

Download Full-text

Parametric Shortest Paths in Planar Graphs

2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS) ◽

10.1109/focs.2019.00057 ◽

2019 ◽

Author(s):

Kshitij Gajjar ◽

Jaikumar Radhakrishnan

Keyword(s):

Planar Graphs ◽

Shortest Paths

Download Full-text