Single source shortest paths in \(H\)-minor free graphs
type: Item
instance of: scholarly article
title: Single source shortest paths in \(H\)-minor free graphs
zbMATH Open document ID: 1196.68177
author: Raphael Yuster
published in: Theoretical Computer Science
publication date: 2010-08-11T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5768901
zbMATH Keywords: shortest paths
zbMATH Keywords: \(H\)-minor free graphs
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.04.028
OpenAlex ID: W2147735052
cites work: A Separator Theorem for Nonplanar Graphs
cites work: On a routing problem
cites work: A note on two problems in connexion with graphs
cites work: Planar graphs, negative weight edges, shortest paths, and near linear time
cites work: Q5514188
cites work: Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
cites work: Fibonacci heaps and their uses in improved network optimization algorithms
cites work: Scaling algorithms for network problems
cites work: Faster Scaling Algorithms for Network Problems
cites work: Q3140424
cites work: Faster shortest-path algorithms for planar graphs
cites work: Shortest paths in directed planar graphs with negative lengths
cites work: Generalized Nested Dissection
cites work: A Separator Theorem for Planar Graphs
cites work: Graph minor theory
cites work: Homomorphieeigenschaften und mittlere Kantendichte von Graphen
cites work: Q3576658
cites work: Graph minors. VIII: A Kuratowski theorem for general surfaces
cites work: Graph minors. XX: Wagner's conjecture
cites work: A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes
cites work: Kuratowski's theorem
cites work: Q2934588
DOI: 10.1016/J.TCS.2010.04.028
description: scientific article; zbMATH DE number 5768901