scientific article; zbMATH DE number 3876619

zbMATH Open0549.68065MaRDI QIDQ3341925FDOQ3341925

Authors: Burkhard Monien 

Publication date: 1982

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

shortest cycleefficient algorithms

Mathematics Subject Classification ID

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

Cited In (11)

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

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)