Pages that link to "Item:Q929296"
From MaRDI portal
The following pages link to Enumerate and expand: Improved algorithms for connected vertex cover and tree cover (Q929296):
Displaying 11 items.
- FPT algorithms for connected feedback vertex set (Q695322) (← links)
- Parameterized algorithm for eternal vertex cover (Q765521) (← links)
- On the parameterized complexity of dynamic problems (Q896122) (← links)
- Connected vertex covers in dense graphs (Q974753) (← links)
- Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← links)
- The union of minimal hitting sets: parameterized combinatorial bounds and counting (Q1044023) (← links)
- Parameterized Complexity of Multi-Node Hubs (Q5009470) (← links)
- (Q5009490) (← links)
- A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps. (Q5089241) (← links)
- (Q5090497) (← links)
- Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems (Q6071818) (← links)
