scientific article
From MaRDI portal
Publication:2921664
zbMath1297.05059MaRDI QIDQ2921664
Publication date: 13 October 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (40)
Minimum Cuts in Surface Graphs ⋮ Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time ⋮ A substring-substring LCS data structure ⋮ Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs ⋮ Some recent progress and applications in graph minor theory ⋮ Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time ⋮ Non-crossing shortest paths lengths in planar graphs in linear time ⋮ Non-crossing shortest paths lengths in planar graphs in linear time ⋮ Dynamic planar embeddings of dynamic graphs ⋮ Unnamed Item ⋮ Faster shortest paths in dense distance graphs, with applications ⋮ Approximation algorithms via contraction decomposition ⋮ How vulnerable is an undirected planar graph with respect to max flow ⋮ Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths ⋮ The tight orthogonal homotopic bases of closed oriented triangulated surfaces and their computing ⋮ Bounds on half graph orders in powers of sparse graphs ⋮ Counting and sampling minimum cuts in genus \(g\) graphs ⋮ Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. ⋮ A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals ⋮ Decremental SPQR-trees for Planar Graphs ⋮ Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs ⋮ On almost Monge all scores matrices ⋮ Faster approximate diameter and distance oracles in planar graphs ⋮ Shortest-path queries in static networks ⋮ Planar graphs, negative weight edges, shortest paths, and near linear time ⋮ Efficient dynamic approximate distance oracles for vertex-labeled planar graphs ⋮ Lattices and Maximum Flow Algorithms in Planar Graphs ⋮ Fault-tolerant distance labeling for planar graphs ⋮ Min-Cost Flow in Unit-Capacity Planar Graphs ⋮ Single-source shortest paths and strong connectivity in dynamic planar graphs ⋮ Many distances in planar graphs ⋮ Engineering Route Planning Algorithms ⋮ Faster Approximate Diameter and Distance Oracles in Planar Graphs ⋮ Non-crossing shortest paths in undirected unweighted planar graphs in linear time ⋮ Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Fault-tolerant distance labeling for planar graphs
This page was built for publication:
