Algorithms for finding minimum fundamental cycle bases in graphs

DOI10.1016/j.endm.2004.03.009zbMath1152.05370OpenAlexW2022364578MaRDI QIDQ3439123

Leo Liberti, Edoardo Amaldi, Francesco Maffioli, Nelson F. 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

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

Related Items

Sensor Network Localization on the Group of Three-Dimensional Displacements, Edge-swapping algorithms for the minimum fundamental cycle basis problem, Minimum Cycle Bases and Their Applications, Minimum weakly fundamental cycle bases are hard to find

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for Generating Fundamental Cycles in a Graph
• An algorithm for finding a fundamental set of cycles of a graph
• Approximation and Online Algorithms