A block-parametric method for finding shortest paths in a graph

MaRDI QIDQ5932926zbMATH OpenFDO

Authors V. Rodionov

Publication date 18 June 2001

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

parametric methodshortest paths

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Shortest path methods: A unifying approach
• An improvement of Dijkstra's method for finding a shortest path in a graph
• scientific article; zbMATH DE number 30302
• Shortest‐path methods: Complexity, interrelations and new propositions
• scientific article; zbMATH DE number 6304483

Cited in

(1)

• Finding the Anti-block Vital Edge of a Shortest Path Between Two Nodes

This page was built for publication: A block-parametric method for finding shortest paths in a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5932926)