Algorithms for shortest paths and d-cycle problems

DOI10.1016/S1570-8667(03)00002-9MaRDI QIDQ876687zbMATH OpenFDO

Authors Sergei Bespamyatnikh, A. 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

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

Recommendations

• Automata, Languages and Programming
• STACS 2005
• A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
• Finding shorter cycles in a weighted graph
• scientific article; zbMATH DE number 3876619

Cites work

• scientific article; zbMATH DE number 3167398 (Why is no real title available?)
• A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
• A note on two problems in connexion with graphs
• Fibonacci heaps and their uses in improved network optimization algorithms
• Finding the k Shortest Paths
• Minimum Path Bases
• The Complexity of Multiterminal Cuts

Cited in

(7)

• On cycle cones and polyhedra
• Efficient Algorithms for Solving the Shortest Covering Path Problem
• The minimum spanning subgraph problem with given cyclomatic number
• Implementation of algorithms forK shortest loopless paths
• FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs
• Algorithms for the constrained quickest path problem and the enumeration of quickest paths
• Exact Solution Algorithms for the Chordless Cycle Problem

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

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