Pages that link to "Item:Q1775017"

The following pages link to On the approximability of the maximum induced matching problem (Q1775017):

Displaying 43 items.

• A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem (Q336528) (← links)
• Maximum matching in multi-interface networks (Q393046) (← links)
• Two greedy consequences for maximum induced matchings (Q497673) (← links)
• 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)
• Maximum induced matching of hexagonal graphs (Q726519) (← 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)
• Locally searching for large induced matchings (Q1704586) (← links)
• Approximating weighted induced matchings (Q1752475) (← links)
• Maximum induced matching algorithms via vertex ordering characterizations (Q1986960) (← links)
• Approximating maximum acyclic matchings by greedy and local search strategies (Q2019502) (← links)
• Maximum weight induced matching in some subclasses of bipartite graphs (Q2023124) (← links)
• On the induced matching problem in Hamiltonian bipartite graphs (Q2059914) (← links)
• Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs (Q2118390) (← 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)
• On the equality of the induced matching number and the uniquely restricted matching number for subcubic graphs (Q2283036) (← links)
• New kernels for several problems on planar graphs (Q2285156) (← links)
• On some hard and some tractable cases of the maximum acyclic matching problem (Q2288858) (← links)
• Moderately exponential time algorithms for the maximum induced matching problem (Q2355320) (← links)
• Exact algorithms for maximum induced matching (Q2407101) (← links)
• Strong edge-colouring and induced matchings (Q2445264) (← links)
• Generalizing the induced matching by edge capacity constraints (Q2467130) (← links)
• Induced Matching in Some Subclasses of Bipartite Graphs (Q2971661) (← links)
• Almost Induced Matching: Linear Kernels and Parameterized Algorithms (Q3181060) (← links)
• On Distance-3 Matchings and Induced Matchings (Q3655145) (← links)
• Improved Induced Matchings in Sparse Graphs (Q3656857) (← links)
• Well-indumatched Trees and Graphs of Bounded Girth (Q5060441) (← links)
• From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More (Q5115701) (← links)
• Integer Programming Formulations and Benders Decomposition for the Maximum Induced Matching Problem (Q5131709) (← links)
• Maximum Induced Matching Algorithms via Vertex Ordering Characterizations (Q5136263) (← links)
• Recent progress on strong edge-coloring of graphs (Q5242836) (← links)
• Induced Matchings in Graphs of Degree at Most 4 (Q5743551) (← links)
• (Q5869351) (← links)
• MIP formulations for induced graph optimization problems: a tutorial (Q6056886) (← links)