Pages that link to "Item:Q6038700"
From MaRDI portal
The following pages link to On the parameterized complexity of the acyclic matching problem (Q6038700):
Displaying 4 items.
- Parameterized complexity of conflict-free matchings and paths (Q2182094) (← links)
- Parameterized complexity of perfectly matched sets (Q6038698) (← links)
- Minimum maximal acyclic matching in proper interval graphs (Q6648282) (← links)
- Parameterized results on acyclic matchings with implications for related problems (Q6655671) (← links)