Pages that link to "Item:Q1775017"
From MaRDI portal
The following pages link to On the approximability of the maximum induced matching problem (Q1775017):
Displayed 14 items.
- Improved induced matchings in sparse graphs (Q608287) (← links)
- On the induced matching problem (Q657915) (← links)
- Maximum regular induced subgraphs in \(2P_3\)-free graphs (Q690473) (← links)
- On distance-3 matchings and induced matchings (Q716178) (← links)
- Approximability results for the maximum and minimum maximal induced matching problems (Q937401) (← links)
- Approximation hardness of dominating set problems in bounded degree graphs (Q958303) (← links)
- Efficient edge domination in regular graphs (Q1005253) (← links)
- The parameterized complexity of the induced matching problem (Q1028465) (← links)
- An inequality for polymatroid functions and its applications. (Q1410680) (← links)
- Maximum induced matchings of random cubic graphs (Q1612292) (← links)
- The complexity of dissociation set problems in graphs (Q2275943) (← links)
- Generalizing the induced matching by edge capacity constraints (Q2467130) (← links)
- On Distance-3 Matchings and Induced Matchings (Q3655145) (← links)
- Improved Induced Matchings in Sparse Graphs (Q3656857) (← links)