Multiple-source shortest paths in planar graphs
From MaRDI portal
Recommendations
Cited in
(60)- A substring-substring LCS data structure
- Dynamic planar embeddings of dynamic graphs
- Faster shortest paths in dense distance graphs, with applications
- On almost Monge all scores matrices
- Approximation algorithms via contraction decomposition
- Faster approximate diameter and distance oracles in planar graphs
- Single-source shortest paths and strong connectivity in dynamic planar graphs
- Non-crossing shortest paths in undirected unweighted planar graphs in linear time
- Planar graphs, negative weight edges, shortest paths, and near linear time
- Bounds on half graph orders in powers of sparse graphs
- Multiple-source shortest paths in embedded graphs
- 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
- Lattices and maximum flow algorithms in planar graphs
- Shortest path queries in planar graphs
- Shortest-Path Queries in Planar Graphs on GPU-Accelerated Architectures
- Towards single face shortest vertex-disjoint paths in undirected planar graphs
- Short path queries in planar graphs in constant time
- Shortest paths in planar graphs with real lengths in \(O(n \log^{2} n/ \log \log n)\) time
- Engineering Route Planning Algorithms
- scientific article; zbMATH DE number 176745 (Why is no real title available?)
- Counting and sampling minimum cuts in genus g graphs
- Encoding shortest paths in spatial networks
- Improved bounds for shortest paths in dense distance graphs
- Decremental SPQR-trees for Planar Graphs
- A fully dynamic approximation scheme for all-pairs shortest paths in planar graphs
- Min-Cost Flow in Unit-Capacity Planar Graphs
- Faster Approximate Diameter and Distance Oracles in Planar Graphs
- A near-linear approximation scheme for multicuts of embedded graphs with a fixed number of terminals
- Shortest-path queries in static networks
- Improved distance queries in planar graphs
- Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time
- Linear-time algorithms for max flow and multiple-source shortest paths in unit-weight planar graphs
- Exact distance oracles for planar graphs
- Single source distance oracle for planar digraphs avoiding a failed node or link
- Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
- Global minimum cuts in surface embedded graphs
- Voronoi diagrams on planar graphs, and computing the diameter in deterministic \(\tilde{O}(n^{5/3})\) time
- Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs.
- Minimum Cuts in Surface Graphs
- Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time
- Algorithms and Computation
- Fault-tolerant distance labeling for planar graphs
- Many distances in planar graphs
- Fault-tolerant distance labeling for planar graphs
- Non-crossing shortest paths lengths in planar graphs in linear time
- Non-crossing shortest paths lengths in planar graphs in linear time
- How vulnerable is an undirected planar graph with respect to max flow
- The tight orthogonal homotopic bases of closed oriented triangulated surfaces and their computing
- Efficient algorithms for shortest path queries in planar digraphs
- Simplifying and unifying replacement paths algorithms in weighted directed graphs
- Shortest path computations in source-deplanarized graphs
- Fully dynamic strongly connected components in planar digraphs
- Almost optimal exact distance oracles for planar graphs
- An almost optimal edit distance oracle
- Fully dynamic algorithms for minimum weight cycle and related problems
- Testing whether a subgraph is convex or isometric
- Bounded weighted edit distance: dynamic algorithms and matching lower bounds
- Faster construction of a planar distance oracle with \(\tilde{O}(1)\) query time
- Some recent progress and applications in graph minor theory
This page was built for publication: Multiple-source shortest paths in planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921664)
