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 ◽

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

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 ◽

Author(s):

Jittat Fakcharoenphol ◽

Satish Rao

Keyword(s):

Planar Graphs ◽

Linear Time ◽

Shortest Paths ◽

Negative Weight

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 ◽

Download Full-text

Efficient parallel algorithms for shortest paths in planar graphs

SWAT 90 - Lecture Notes in Computer Science ◽

10.1007/3-540-52846-6_98 ◽

1990 ◽

pp. 288-300 ◽

Author(s):

Grammati E. Pantziou ◽

Paul G. Spirakis ◽

Christos D. Zaroliagis

Keyword(s):

Parallel Algorithms ◽

Planar Graphs ◽

Download Full-text

A linear-processor polylog-time algorithm for shortest paths in planar graphs

Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science ◽

10.1109/sfcs.1993.366861 ◽

2002 ◽

Author(s):

P.N. Klein ◽

S. Subramanian

Keyword(s):

Planar Graphs ◽

Shortest Paths ◽

Download Full-text

GPU-accelerated shortest paths computations for planar graphs

Advances in GPU Research and Practice ◽

10.1016/b978-0-12-803738-6.00011-2 ◽

2017 ◽

pp. 273-306 ◽

Author(s):

G. Chapuis ◽

H. Djidjev ◽

D. Lavenier ◽

R. Andonov

Keyword(s):

Planar Graphs ◽

Download Full-text

Dynamic algorithms for shortest paths in planar graphs

Theoretical Computer Science ◽

10.1016/0304-3975(93)90328-q ◽

1993 ◽

Vol 116 (2) ◽

pp. 359-371 ◽

Author(s):

Esteban Feuerstein ◽

Alberto Marchetti-Spaccamela

Keyword(s):

Planar Graphs ◽

Shortest Paths ◽

Dynamic Algorithms

Download Full-text

On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611974331.ch53 ◽

2015 ◽

Author(s):

Ittai Abraham ◽

Shiri Chechik ◽

Daniel Delling ◽

Andrew V. Goldberg ◽

Renato F. Werneck

Keyword(s):

Planar Graphs ◽

Shortest Paths ◽

Download Full-text

Maximum st-Flow in Directed Planar Graphs via Shortest Paths

Lecture Notes in Computer Science - Combinatorial Algorithms ◽

10.1007/978-3-642-45278-9_36 ◽

2013 ◽

pp. 423-427 ◽

Author(s):

Glencora Borradaile ◽

Anna Harutyunyan

Keyword(s):

Planar Graphs ◽

Download Full-text