Pages that link to "Item:Q3591315"
From MaRDI portal
The following pages link to Enumerate and Expand: New Runtime Bounds for Vertex Cover Variants (Q3591315):
Displayed 10 items.
- Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover (Q456689) (← links)
- Enumerate and expand: Improved algorithms for connected vertex cover and tree cover (Q929296) (← links)
- 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 algorithms for the connected vertex cover problem in 4-regular graphs (Q1735245) (← links)
- Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs (Q2266936) (← links)
- The connected vertex cover problem in \(k\)-regular graphs (Q2424831) (← links)
- Complexity and Approximation Results for the Connected Vertex Cover Problem (Q3508568) (← links)
- Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms (Q3656854) (← links)
- Quantum speedup for solving the minimum vertex cover problem based on Grover search algorithm (Q6107781) (← links)