Pages that link to "Item:Q3590960"
From MaRDI portal
The following pages link to New Approximation Algorithms for Minimum Cycle Bases of Graphs (Q3590960):
Displaying 9 items.
- Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← links)
- New approximation algorithms for minimum cycle bases of graphs (Q633843) (← links)
- Cycle bases of graphs and sampled manifolds (Q733440) (← links)
- Efficient approximation algorithms for shortest cycles in undirected graphs (Q987804) (← links)
- An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs (Q1006382) (← links)
- Minimum cycle bases of weighted outerplanar graphs (Q1675771) (← links)
- New length bounds for cycle bases (Q2380021) (← links)
- Minimum Cycle Bases and Their Applications (Q3637310) (← links)
- Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs (Q5458575) (← links)
