Algorithms for shortest paths and \(d\)-cycle problems

DOI10.1016/S1570-8667(03)00002-9zbMath1118.05312MaRDI QIDQ876687

Sergei Bespamyatnikh, Andrei V. Kelarev

Publication date: 26 April 2007

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

zbMATH Keywords

shortest pathcyclomatic number\(d\)-cycle problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Minimum Path Bases
• A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
• Finding the k Shortest Paths
• The Complexity of Multiterminal Cuts
• Fibonacci heaps and their uses in improved network optimization algorithms

This page was built for publication: Algorithms for shortest paths and \(d\)-cycle problems