Pages that link to "Item:Q1029002"
From MaRDI portal
The following pages link to On finding cycle bases and fundamental cycle bases with a shortest maximal cycle (Q1029002):
Displaying 12 items.
- Counting 2-connected deletion-minors of binary matroids (Q385399) (← links)
- Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← links)
- On the approximability of the minimum strictly fundamental cycle basis problem (Q629358) (← links)
- Minimum weakly fundamental cycle bases are hard to find (Q1024786) (← links)
- On finding a cycle basis with a shortest maximal cycle (Q1349748) (← links)
- The minimum stretch spanning tree problem for typical graphs (Q2046233) (← links)
- Hardness and efficiency on \(t\)-admissibility for graph operations (Q2231778) (← links)
- The zoo of tree spanner problems (Q2476246) (← links)
- Optimality computation of the minimum stretch spanning tree problem (Q2656713) (← links)
- (Q4474081) (← links)
- An improved heuristic for computing short integral cycle bases (Q5406185) (← links)
- Approximation and Online Algorithms (Q5896929) (← links)