Pages that link to "Item:Q2288858"
From MaRDI portal
The following pages link to On some hard and some tractable cases of the maximum acyclic matching problem (Q2288858):
Displaying 9 items.
- Approximating maximum acyclic matchings by greedy and local search strategies (Q2019502) (← links)
- Acyclic matchings in graphs of bounded maximum degree (Q2138980) (← links)
- Matchings under distance constraints. I (Q2241576) (← links)
- Acyclic matching in some subclasses of graphs (Q2680984) (← links)
- Acyclic Matching in Some Subclasses of Graphs (Q5041209) (← links)
- On the parameterized complexity of the acyclic matching problem (Q6038700) (← links)
- Matchings under distance constraints. II. (Q6596960) (← links)
- On the complexity of minimum maximal acyclic matchings (Q6621851) (← links)
- Parameterized results on acyclic matchings with implications for related problems (Q6655671) (← links)
