Pages that link to "Item:Q937401"
From MaRDI portal
The following pages link to Approximability results for the maximum and minimum maximal induced matching problems (Q937401):
Displaying 24 items.
- Graphs with maximal induced matchings of the same size (Q344824) (← links)
- Complexity of finding maximum regular induced subgraphs with prescribed degree (Q401302) (← links)
- On minimum maximal distance-\(k\) matchings (Q509288) (← links)
- On distance-3 matchings and induced matchings (Q716178) (← links)
- The parameterized complexity of the induced matching problem (Q1028465) (← links)
- Approximating weighted induced matchings (Q1752475) (← links)
- Approximating maximum acyclic matchings by greedy and local search strategies (Q2019502) (← links)
- On the computational complexity of the Helly number in the \(P_3\) and related convexities (Q2132356) (← links)
- Parameterized algorithms and kernels for almost induced matching (Q2210504) (← links)
- Linear programming based approximation for unweighted induced matchings -- breaking the \(\varDelta\) barrier (Q2218644) (← links)
- The complexity of dissociation set problems in graphs (Q2275943) (← links)
- New kernels for several problems on planar graphs (Q2285156) (← links)
- Moderately exponential time algorithms for the maximum induced matching problem (Q2355320) (← links)
- Exact algorithms for maximum induced matching (Q2407101) (← links)
- Weighted upper domination number (Q2413167) (← links)
- Almost Induced Matching: Linear Kernels and Parameterized Algorithms (Q3181060) (← links)
- On Distance-3 Matchings and Induced Matchings (Q3655145) (← links)
- Well-indumatched Trees and Graphs of Bounded Girth (Q5060441) (← links)
- Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem (Q5131709) (← links)
- (Q5869351) (← links)
- On the complexity of minimum maximal acyclic matchings (Q6621851) (← links)
- Edge open packing: complexity, algorithmic aspects, and bounds (Q6646442) (← links)
- Minimum maximal acyclic matching in proper interval graphs (Q6648282) (← links)
- Well-indumatched pseudoforests (Q6657223) (← links)
