Single source shortest paths in H-minor free graphs
From MaRDI portal
Recommendations
- A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes
- Catalan structures and dynamic programming in \(H\)-minor-free graphs
- Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation
- Undirected single-source shortest paths with positive integer weights in linear time
- Shortest paths in planar graphs with real lengths in \(O(n \log^{2} n/ \log \log n)\) time
Cites work
- A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes
- A note on two problems in connexion with graphs
- A Separator Theorem for Nonplanar Graphs
- A Separator Theorem for Planar Graphs
- Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
- Fast separation in a graph with an excluded minor
- Faster Scaling Algorithms for Network Problems
- Faster shortest-path algorithms for planar graphs
- Fibonacci heaps and their uses in improved network optimization algorithms
- Generalized Nested Dissection
- Graph minor theory
- Graph minors. VIII: A Kuratowski theorem for general surfaces
- Graph minors. XX: Wagner's conjecture
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- scientific article; zbMATH DE number 437547 (Why is no real title available?)
- scientific article; zbMATH DE number 3225808 (Why is no real title available?)
- Kuratowski's theorem
- Maximum matching in graphs with an excluded minor
- On a routing problem
- Planar graphs, negative weight edges, shortest paths, and near linear time
- Scaling algorithms for network problems
- Shortest paths in directed planar graphs with negative lengths: a linear-space \(O(n\log^{2} n)\)-time algorithm
Cited in
(3)
This page was built for publication: Single source shortest paths in \(H\)-minor free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q986535)
