Algorithms for shortest paths and d-cycle problems

DOI10.1016/S1570-8667(03)00002-9zbMATH Open1118.05312MaRDI QIDQ876687FDOQ876687

Authors: Sergei Bespamyatnikh, A. V. Kelarev 

Publication date: 26 April 2007

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

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

zbMATH Keywords

shortest pathcyclomatic number\(d\)-cycle problem

Mathematics Subject Classification ID

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

Cites Work

• A note on two problems in connexion with graphs
• Finding the k Shortest Paths
• Fibonacci heaps and their uses in improved network optimization algorithms
• A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
• The Complexity of Multiterminal Cuts
• Title not available (Why is that?)
• Minimum Path Bases

Cited In (7)

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

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)