Pages that link to "Item:Q2948473"
From MaRDI portal
The following pages link to An Improved Exact Algorithm for Maximum Induced Matching (Q2948473):
Displaying 15 items.
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems (Q507444) (← links)
- Exact algorithms for minimum weighted dominating induced matching (Q521800) (← links)
- Improved induced matchings in sparse graphs (Q608287) (← links)
- The general maximum matching algorithm of Micali and Vazirani (Q1105385) (← links)
- On the approximability of the maximum induced matching problem (Q1775017) (← links)
- Parameterized algorithms and kernels for almost induced matching (Q2210504) (← links)
- Exact algorithms for dominating induced matching based on graph partition (Q2352792) (← links)
- Exact algorithms for maximum induced matching (Q2407101) (← links)
- Almost Induced Matching: Linear Kernels and Parameterized Algorithms (Q3181060) (← links)
- Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs (Q3452575) (← links)
- A Faster Algorithm for Maximum Induced Matchings on Circle Graphs (Q4585063) (← links)
- On the Induced Matching Problem (Q4910736) (← links)
- Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs (Q5025046) (← links)
- An improvement on Łuczak's connected matchings method (Q6133269) (← links)
- Minimum number of maximal dissociation sets in trees (Q6193972) (← links)