Pages that link to "Item:Q629358"
From MaRDI portal
The following pages link to On the approximability of the minimum strictly fundamental cycle basis problem (Q629358):
Displaying 5 items.
- Minimum strictly fundamental cycle bases of planar graphs are hard to find (Q266952) (← links)
- Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← links)
- Minimum cut bases in undirected networks (Q968141) (← links)
- Edge-swapping algorithms for the minimum fundamental cycle basis problem (Q1014301) (← links)
- On minimum average stretch spanning trees in polygonal 2-trees (Q2339451) (← links)
