Algorithms for finding minimum fundamental cycle bases in graphs

DOI10.1016/J.ENDM.2004.03.009MaRDI QIDQ3439123zbMATH OpenOpenAlexFDO

Authors E. Amaldi, Leo Liberti, Francesco Maffioli, Nelson Maculan

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2004.03.009

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Paths and cycles (05C38)

Recommendations

• The minimum fundamental cycle basic problem: a new heuristic based on edge swaps
• Edge-swapping algorithms for the minimum fundamental cycle basis problem
• Mathematical models and a constructive heuristic for finding minimum fundamental cycle bases
• Implementing minimum cycle basis algorithms
• Automata, Languages and Programming

Cites work

• scientific article; zbMATH DE number 3741435 (Why is no real title available?)
• scientific article; zbMATH DE number 1082103 (Why is no real title available?)
• scientific article; zbMATH DE number 1145916 (Why is no real title available?)
• Algorithms for Generating Fundamental Cycles in a Graph
• An algorithm for finding a fundamental set of cycles of a graph
• Approximation and Online Algorithms

Cited in

(15)

• Benchmarks for Strictly Fundamental Cycle Bases
• scientific article; zbMATH DE number 4010557 (Why is no real title available?)
• Edge-swapping algorithms for the minimum fundamental cycle basis problem
• On the approximability of the minimum strictly fundamental cycle basis problem
• New approximation algorithms for minimum cycle bases of graphs
• Minimum weakly fundamental cycle bases are hard to find
• Minimum Cycle Bases and Their Applications
• scientific article; zbMATH DE number 7760193 (Why is no real title available?)
• Lower bounds for strictly fundamental cycle bases in grid graphs
• Mathematical models and a constructive heuristic for finding minimum fundamental cycle bases
• A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
• Revised Greedy algorithm for formation of a minimal cycle basis of a graph
• The minimum fundamental cycle basic problem: a new heuristic based on edge swaps
• Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs
• Sensor network localization on the group of three-dimensional displacements

This page was built for publication: Algorithms for finding minimum fundamental cycle bases in graphs

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