scientific article; zbMATH DE number 2080984

MaRDI QIDQ4474081zbMATH OpenFDO

Authors Giulia Galbiati

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2223/22230116.htm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Paths and cycles (05C38)

Recommendations

• Minimum Cycle Bases and Their Applications
• On finding a cycle basis with a shortest maximal cycle
• On finding cycle bases and fundamental cycle bases with a shortest maximal cycle
• Minimum Cycle Bases in Graphs Algorithms and Applications
• Minimum cycle bases of graphs over different fields
• scientific article; zbMATH DE number 1229606
• Minimum cycle bases, faster and simpler
• Minimum cycle bases of Halin graphs
• Minimum cycle bases for network graphs
• Minimum cycle bases of lexicographic products

Cited in

(11)

• The zoo of tree spanner problems
• Minimum cut bases in undirected networks
• Minimum strictly fundamental cycle bases of planar graphs are hard to find
• On finding cycle bases and fundamental cycle bases with a shortest maximal cycle
• Approximation and Online Algorithms
• On the approximability of the minimum strictly fundamental cycle basis problem
• Cycle‐minors and subdivisions of wheels
• Minimum weakly fundamental cycle bases are hard to find
• On a Special Co-cycle Basis of Graphs
• Rooted cycle bases
• Rooted cycle bases

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 Q4474081)