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 23 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)
- An efficient heuristic algorithm for solving connected vertex cover problem (Q1720833) (← links)
- Complexity and algorithms for the connected vertex cover problem in 4-regular graphs (Q1735245) (← links)
- Parameterized measure \& conquer for problems with no small kernels (Q1759684) (← links)
- A relaxation of the directed disjoint paths problem: a global congestion metric helps (Q2055975) (← links)
- Parameterized complexity of multi-node hubs (Q2084737) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- The connected vertex cover problem in \(k\)-regular graphs (Q2424831) (← links)
- Polynomial kernelizations for MIN \(F^{+}\Pi _{1}\) and MAX NP (Q2429346) (← links)
- \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms (Q2677827) (← links)
- Enumerate and Measure: Improving Parameter Budget Management (Q3058690) (← links)
- Parameterized Power Vertex Cover (Q3181050) (← links)
- (Q3304124) (← 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)
