Minimum cycle bases, faster and simpler
From MaRDI portal
Recommendations
Cited in
(32)- Implementing minimum cycle basis algorithms
- The lattice of cycles of an undirected graph
- Fast algorithms for minimum homology basis
- Cycle bases in graphs characterization, algorithms, complexity, and applications
- Breaking the O(m 2 n) Barrier for Minimum Cycle Bases
- Fair matchings and related problems
- An improved heuristic for computing short integral cycle bases
- Automata, Languages and Programming
- New Approximation Algorithms for Minimum Cycle Bases of Graphs
- On finding a cycle basis with a shortest maximal cycle
- An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs
- Minimum Cycle Bases in Graphs Algorithms and Applications
- Length bounds for cycle bases of graphs
- Minimum Cycle Bases and Their Applications
- On optimal cycle bases of graphs for mesh analysis of networks
- Experimental and Efficient Algorithms
- scientific article; zbMATH DE number 2080984 (Why is no real title available?)
- A novel technique for cohomology computations in engineering practice
- Faster Algorithms for Minimum Cycle Basis in Directed Graphs
- Classes of cycle bases
- Properties of Gomory-Hu co-cycle bases
- Integral cycle bases for cyclic timetabling
- Rooted cycle bases
- Rooted cycle bases
- Minimum cycle bases for network graphs
- Computing cyclic invariants for molecular graphs
- Assigning papers to referees
- A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
- Flow and Elastic Networks on the 𝑛-Torus: Geometry, Analysis, and Computation
- New length bounds for cycle bases
- Minimum Path Bases
- Minimum cycle bases of weighted outerplanar graphs
This page was built for publication: Minimum cycle bases, faster and simpler
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6486930)
