Single source shortest paths in \(H\)-minor free graphs

DOI10.1016/j.tcs.2010.04.028zbMath1196.68177OpenAlexW2147735052MaRDI QIDQ986535

Raphael Yuster

Publication date: 11 August 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.04.028

zbMATH Keywords

shortest paths\(H\)-minor free graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Simple PTAS's for families of graphs excluding a minor

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Graph minors. XX: Wagner's conjecture
• Scaling algorithms for network problems
• Planar graphs, negative weight edges, shortest paths, and near linear time
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• Graph minors. VIII: A Kuratowski theorem for general surfaces
• On a routing problem
• Graph minor theory
• Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
• A Separator Theorem for Planar Graphs
• Generalized Nested Dissection
• Kuratowski's theorem
• A Separator Theorem for Nonplanar Graphs
• Faster Scaling Algorithms for Network Problems
• Fibonacci heaps and their uses in improved network optimization algorithms
• A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes
• Faster shortest-path algorithms for planar graphs

This page was built for publication: Single source shortest paths in \(H\)-minor free graphs