The following pages link to (Q5530471):
Displaying 8 items.
- New approximation algorithms for minimum cycle bases of graphs (Q633843) (← links)
- An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs (Q1006382) (← links)
- A combinatorial optimization problem: optimal generalized cycle bases (Q1141461) (← links)
- On finding a cycle basis with a shortest maximal cycle (Q1349748) (← links)
- Robust cycle bases do not exist for \(K_{n, n}\) if \(n \geq 8\) (Q1682895) (← links)
- Cycle interpolation properties of graphs (Q1897442) (← links)
- Minimum spanning tree cycle intersection problem (Q2656964) (← links)
- The Null Space Problem I. Complexity (Q3747622) (← links)