Pages that link to "Item:Q2019502"
From MaRDI portal
The following pages link to Approximating maximum acyclic matchings by greedy and local search strategies (Q2019502):
Displaying 4 items.
- Acyclic matching in some subclasses of graphs (Q2680984) (← links)
- On the parameterized complexity of the acyclic matching problem (Q6038700) (← links)
- Minimum maximal acyclic matching in proper interval graphs (Q6648282) (← links)
- Parameterized results on acyclic matchings with implications for related problems (Q6655671) (← links)