scientific article
From MaRDI portal
Publication:2754134
zbMath0973.68535MaRDI QIDQ2754134
Publication date: 9 December 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)
Related Items (13)
A new approach to all-pairs shortest paths on real-weighted graphs ⋮ A survey of the all-pairs shortest paths problem and its variants in graphs ⋮ A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes ⋮ Solving all-pairs shortest path by single-source computations: theory and practice ⋮ A novel pseudo‐polynomial approach for shortest path problems ⋮ Shortest distances as enumeration problem ⋮ On dynamic shortest paths problems ⋮ The saga of minimum spanning trees ⋮ A double scaling algorithm for the constrained maximum flow problem ⋮ A faster polynomial algorithm for the constrained maximum flow problem ⋮ Integer priority queues with decrease key in constant time and the single source shortest paths problem ⋮ Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation ⋮ Unnamed Item
This page was built for publication:
