Implementing minimum cycle basis algorithms

MaRDI QIDQ3507772zbMATH OpenFDO

Authors K. Mehlhorn, Dimitrios Michail

Publication date 20 June 2008

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Experimental and Efficient Algorithms
• Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs
• Automata, Languages and Programming
• An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs
• Minimum cycle bases, faster and simpler

Cited in

(12)

• Minimum cycle bases of weighted outerplanar graphs
• On the role of differential adhesion in gangliogenesis in the enteric nervous system
• Building stable chains with motile agents: insights into the morphology of enteric neural crest cell migration
• Algorithms for finding minimum fundamental cycle bases in graphs
• Rooted cycle bases
• Structural stability and jamming of self-organized cluster conformations in dense granular materials
• Cycle bases in graphs characterization, algorithms, complexity, and applications
• Detecting Determinism in Time Series with Complex Networks Constructed Using a Compression Algorithm
• Experimental and Efficient Algorithms
• New approximation algorithms for minimum cycle bases of graphs
• Cycle bases of graphs and sampled manifolds
• Evolutionary algorithms and matroid optimization problems

This page was built for publication: Implementing minimum cycle basis algorithms

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