scientific article; zbMATH DE number 3876619

MaRDI QIDQ3341925zbMATH OpenFDO

Authors Burkhard Monien

Publication date 1982

zbMATH Keywords

efficient algorithmsshortest cycle

Mathematics Subject Classification ID

Paths and cycles (05C38) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Finding Even Cycles Even Faster
• Finding even cycles even faster
• Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs
• Efficient approximation algorithms for shortest cycles in undirected graphs
• A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph

Cited in

(13)

• An efficient Dijkstra-like labeling method for computing shortest odd/even paths
• An inherently iterative computation of Ackermann's function
• A shortest cycle for each vertex of a graph
• The even-path problem for graphs and digraphs
• Finding Even Cycles Even Faster
• Finding even cycles even faster
• Detecting short directed cycles using rectangular matrix multiplication and dynamic programming
• scientific article; zbMATH DE number 3231691 (Why is no real title available?)
• LATIN 2004: Theoretical Informatics
• Finding shorter cycles in a weighted graph
• Shortest odd paths in undirected graphs with conservative weight functions
• Finding a shortest cycle in a subspace of the cycle space of a graph
• Algorithms for shortest paths and d-cycle problems

This page was built for publication:

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