The following pages link to (Q4474081):
Displaying 8 items.
- Minimum strictly fundamental cycle bases of planar graphs are hard to find (Q266952) (← links)
- On the approximability of the minimum strictly fundamental cycle basis problem (Q629358) (← links)
- Minimum cut bases in undirected networks (Q968141) (← links)
- Minimum weakly fundamental cycle bases are hard to find (Q1024786) (← links)
- On finding cycle bases and fundamental cycle bases with a shortest maximal cycle (Q1029002) (← links)
- The zoo of tree spanner problems (Q2476246) (← links)
- Cycle‐minors and subdivisions of wheels (Q3652544) (← links)
- Approximation and Online Algorithms (Q5896929) (← links)
