Pages that link to "Item:Q1028465"
From MaRDI portal
The following pages link to The parameterized complexity of the induced matching problem (Q1028465):
Displayed 5 items.
- Improved induced matchings in sparse graphs (Q608287) (← links)
- On distance-3 matchings and induced matchings (Q716178) (← links)
- Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- Improved Induced Matchings in Sparse Graphs (Q3656857) (← links)