Pages that link to "Item:Q2921664"
From MaRDI portal
The following pages link to Multiple-source shortest paths in planar graphs (Q2921664):
Displaying 44 items.
- Counting and sampling minimum cuts in genus \(g\) graphs (Q471138) (← links)
- The tight orthogonal homotopic bases of closed oriented triangulated surfaces and their computing (Q640484) (← links)
- Shortest path computations in source-deplanarized graphs (Q685480) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- A fully dynamic approximation scheme for shortest paths in planar graphs (Q1273930) (← links)
- A substring-substring LCS data structure (Q1625599) (← links)
- Dynamic planar embeddings of dynamic graphs (Q1693993) (← links)
- Faster shortest paths in dense distance graphs, with applications (Q1698725) (← links)
- On almost Monge all scores matrices (Q1755777) (← links)
- Approximation algorithms via contraction decomposition (Q1945289) (← links)
- Faster approximate diameter and distance oracles in planar graphs (Q1999961) (← links)
- Single-source shortest paths and strong connectivity in dynamic planar graphs (Q2051854) (← links)
- Non-crossing shortest paths in undirected unweighted planar graphs in linear time (Q2097216) (← links)
- Planar graphs, negative weight edges, shortest paths, and near linear time (Q2496320) (← links)
- Bounds on half graph orders in powers of sparse graphs (Q2699651) (← links)
- Multiple-source shortest paths in embedded graphs (Q2862202) (← links)
- Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths (Q2968519) (← links)
- Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs (Q3012798) (← links)
- Lattices and Maximum Flow Algorithms in Planar Graphs (Q3057636) (← links)
- Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs (Q3452786) (← links)
- Engineering Route Planning Algorithms (Q3637315) (← links)
- (Q5002738) (← links)
- Decremental SPQR-trees for Planar Graphs (Q5009609) (← links)
- A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs (Q5060135) (← links)
- Min-Cost Flow in Unit-Capacity Planar Graphs (Q5075811) (← links)
- Faster Approximate Diameter and Distance Oracles in Planar Graphs (Q5111711) (← links)
- A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals (Q5149755) (← links)
- Shortest-path queries in static networks (Q5176178) (← links)
- Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time (Q5348455) (← links)
- Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs (Q5495844) (← links)
- (Q5743390) (← links)
- (Q5743393) (← links)
- (Q5743404) (← links)
- (Q5743478) (← links)
- Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time (Q5858646) (← links)
- Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. (Q5874499) (← links)
- Minimum Cuts in Surface Graphs (Q5885599) (← links)
- Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time (Q5886044) (← links)
- Efficient dynamic approximate distance oracles for vertex-labeled planar graphs (Q5915659) (← links)
- Fault-tolerant distance labeling for planar graphs (Q5918639) (← links)
- Many distances in planar graphs (Q5920250) (← links)
- Fault-tolerant distance labeling for planar graphs (Q5970814) (← links)
- Non-crossing shortest paths lengths in planar graphs in linear time (Q6153472) (← links)
- How vulnerable is an undirected planar graph with respect to max flow (Q6196897) (← links)
