Pages that link to "Item:Q3434701"
From MaRDI portal
The following pages link to Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover (Q3434701):
Displaying 5 items.
- Fixed-parameter enumerability of cluster editing and related problems (Q970105) (← links)
- Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← links)
- Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (Q2266936) (← links)
- Capacitated Domination and Covering: A Parameterized Perspective (Q3503580) (← links)
- Complexity and Approximation Results for the Connected Vertex Cover Problem (Q3508568) (← links)