Pages that link to "Item:Q2495907"
From MaRDI portal
The following pages link to Minmax subtree cover problem on cacti (Q2495907):
Displaying 6 items.
- On the \(k\)-path cover problem for cacti (Q2369003) (← links)
- A minimum-length covering subtree of a tree (Q3479805) (← links)
- Algorithms and Computation (Q5712159) (← links)
- Approximating bottleneck spanning trees on partitioned tuples of points (Q5881545) (← links)
- Minmax Tree Cover in the Euclidean Space (Q5901435) (← links)
- Maximum max-k-clique subgraphs in cactus subtree graphs (Q6132893) (← links)