Shortest Paths in Planar Graphs with Real Lengths in O(nlog2 n/loglogn) Time
From MaRDI portal
Publication:3586397
DOI10.1007/978-3-642-15781-3_18zbMath1287.05073WikidataQ60143025 ScholiaQ60143025MaRDI QIDQ3586397
Christian Wulff-Nilsen, Shay Mozes
Publication date: 6 September 2010
Published in: Algorithms – ESA 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15781-3_18
05C38: Paths and cycles
05C10: Planar graphs; geometric and topological aspects of graph theory
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Short and Simple Cycle Separators in Planar Graphs, Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time, Unnamed Item, Unnamed Item, Unnamed Item, Level-planar drawings with few slopes, Accelerated Bend Minimization, Fast domino tileability, Counting and sampling minimum cuts in genus \(g\) graphs, Faster shortest paths in dense distance graphs, with applications, Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths, Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs