The following pages link to Algorithms and Computation (Q5712159):
Displaying 5 items.
- Exact approaches for solving a covering problem with capacitated subtrees (Q1722966) (← links)
- Approximate spanning cactus (Q2353648) (← links)
- On the \(k\)-path cover problem for cacti (Q2369003) (← links)
- Minmax subtree cover problem on cacti (Q2495907) (← links)
- Maximum max-k-clique subgraphs in cactus subtree graphs (Q6132893) (← links)