The following pages link to (Q4386084):
Displaying 6 items.
- On the approximability of the minimum strictly fundamental cycle basis problem (Q629358) (← links)
- Minimum cut bases in undirected networks (Q968141) (← links)
- Integral cycle bases for cyclic timetabling (Q1013300) (← links)
- Edge-swapping algorithms for the minimum fundamental cycle basis problem (Q1014301) (← links)
- Algorithms for finding minimum fundamental cycle bases in graphs (Q3439123) (← links)
- Lower bounds for strictly fundamental cycle bases in grid graphs (Q5191140) (← links)
