Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs

Journal of Computer and System Sciences ◽

10.1016/j.jcss.2021.09.008 ◽

2021 ◽

Author(s):

Panagiotis Charalampopoulos ◽

Adam Karczmarz

Keyword(s):

Planar Graphs ◽

Shortest Paths ◽

Single Source ◽

Strong Connectivity

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

Deterministic decremental single source shortest paths: beyond the o(mn) bound

Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing - STOC 2016 ◽

10.1145/2897518.2897521 ◽

2016 ◽

Author(s):

Aaron Bernstein ◽

Shiri Chechik

Keyword(s):

Shortest Paths ◽

Download Full-text

Computing single source shortest paths using single-objective fitness

Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms - FOGA '09 ◽

10.1145/1527125.1527134 ◽

2009 ◽

Author(s):

Surender Baswana ◽

Somenath Biswas ◽

Benjamin Doerr ◽

Tobias Friedrich ◽

Piyush P. Kurur ◽

...

Keyword(s):

Shortest Paths ◽

Single Source ◽

Single Objective

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

A new algorithm for decremental single-source shortest paths with applications to vertex-capacitated flow and cut problems

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing - STOC 2019 ◽

10.1145/3313276.3316320 ◽

2019 ◽

Author(s):

Julia Chuzhoy ◽

Sanjeev Khanna

Keyword(s):

Shortest Paths ◽

Single Source ◽

Download Full-text

Single-Source Shortest Paths

Primers in Electronics and Computer Science - An Elementary Approach to Design and Analysis of Algorithms ◽

10.1142/9781786346766_0009 ◽

2019 ◽

pp. 293-320

Keyword(s):

Shortest Paths ◽

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