Shortest paths in directed planar graphs with negative lengths
From MaRDI portal
Publication:2930306
DOI10.1145/1721837.1721846zbMath1300.05301OpenAlexW1988593903WikidataQ60143024 ScholiaQ60143024MaRDI QIDQ2930306
No author found.
Publication date: 18 November 2014
Published in: (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1721837.1721846
No records found.
No records found.
Related Items (22)
Minimum Cuts in Surface Graphs ⋮ Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs ⋮ Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time ⋮ On the negative cost girth problem in planar networks ⋮ Sublinear separators, fragility and subexponential expansion ⋮ Faster shortest paths in dense distance graphs, with applications ⋮ Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths ⋮ Unnamed Item ⋮ Counting and sampling minimum cuts in genus \(g\) graphs ⋮ Topologically trivial closed walks in directed surface graphs ⋮ Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. ⋮ Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs ⋮ Shortest-path queries in static networks ⋮ Single source shortest paths in \(H\)-minor free graphs ⋮ Fault-tolerant distance labeling for planar graphs ⋮ Single-source shortest paths and strong connectivity in dynamic planar graphs ⋮ Many distances in planar graphs ⋮ Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Fault-tolerant distance labeling for planar graphs
This page was built for publication: Shortest paths in directed planar graphs with negative lengths
