scientific article; zbMATH DE number 6850313

MaRDI QIDQ4607877zbMATH OpenFDO

Authors Adam Karczmarz

Publication date 15 March 2018

Full work available at URL http://dl.acm.org/citation.cfm?id=3175271

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Analysis of algorithms (68W40)

Recommendations

• Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
• Planar graph decomposition and all pairs shortest paths
• Shortcutting Planar Digraphs
• Optimal decremental connectivity in planar graphs
• Optimal decremental connectivity in planar graphs
• On shortest disjoint paths in planar graphs
• On shortest disjoint paths in planar graphs
• Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs
• A fully dynamic approximation scheme for shortest paths in planar graphs
• Decremental single-source reachability in planar digraphs

Cited in

(7)

• Single-source shortest paths and strong connectivity in dynamic planar graphs
• Shortcutting Planar Digraphs
• Decremental single-source reachability in planar digraphs
• Dynamic effective resistances and approximate Schur complement on separable graphs
• Min-Cost Flow in Unit-Capacity Planar Graphs
• scientific article; zbMATH DE number 6783482 (Why is no real title available?)
• Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs.

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4607877)