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

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

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

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

Optimal EREW parallel algorithms for connectivity, ear decomposition and st-numbering of planar graphs

[1991] Proceedings. The Fifth International Parallel Processing Symposium ◽

10.1109/ipps.1991.153761 ◽

2002 ◽

Author(s):

H. Gazit

Keyword(s):

Parallel Algorithms ◽

Planar Graphs ◽

Ear Decomposition

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

Parallel Algorithms for Shortest Paths and Related Problems on Trapezoid Graphs

Algorithms and Computation - Lecture Notes in Computer Science ◽

10.1007/3-540-46632-0_18 ◽

1999 ◽

pp. 173-182 ◽

Author(s):

F. R. Hsu ◽

Yaw-Ling Lin ◽

Yin-Te Tsai

Keyword(s):

Parallel Algorithms ◽

Shortest Paths ◽

Trapezoid Graphs

Download Full-text

Optimal parallel algorithms on planar graphs

Information and Computation ◽

10.1016/0890-5401(90)90034-f ◽

1990 ◽

Vol 84 (1) ◽

pp. 71-96 ◽

Author(s):

Torben Hagerup

Keyword(s):

Parallel Algorithms ◽

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