scientific article; zbMATH DE number 1875419

zbMath1007.05088MaRDI QIDQ4796178

Andrew V. Goldberg

Publication date: 2 March 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2161/21610230

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes ⋮ A novel pseudo‐polynomial approach for shortest path problems ⋮ A faster algorithm for the single source shortest path problem with few distinct positive lengths ⋮ Via Detours to I/O-Efficient Shortest Paths ⋮ Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation ⋮ A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing

This page was built for publication: