Pages that link to "Item:Q1168728"

The following pages link to NP-completeness of some generalizations of the maximum matching problem (Q1168728):

Displaying 50 items.

• 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)
• Quadratic vertex kernel for rainbow matching (Q2300725) (← links)
• Approximating maximum uniquely restricted matchings in bipartite graphs (Q2322866) (← links)
• A generalization of extension complexity that captures P (Q2345857) (← links)
• Maximum induced matchings close to maximum matchings (Q2348267) (← links)
• Moderately exponential time algorithms for the maximum induced matching problem (Q2355320) (← links)
• Exact algorithms for maximum induced matching (Q2407101) (← links)
• On the hardness of deciding the equality of the induced and the uniquely restricted matching number (Q2414056) (← links)
• Maximum \(k\)-regular induced subgraphs (Q2426653) (← links)
• Generalizing the induced matching by edge capacity constraints (Q2467130) (← links)
• Equality of distance packing numbers (Q2515579) (← links)
• The graphs with maximum induced matching and maximum matching the same size (Q2568473) (← links)
• Independent packings in structured graphs (Q2583122) (← links)
• Performance analysis of distance-1 distributed algorithms for admission control under the 2-hop interference model (Q2682938) (← links)
• Perfectly matched sets in graphs: parameterized and exact computation (Q2697539) (← links)
• Induced matchings in graphs of bounded maximum degree (Q2826215) (← links)
• Induced Matching in Some Subclasses of Bipartite Graphs (Q2971661) (← links)
• Almost Induced Matching: Linear Kernels and Parameterized Algorithms (Q3181060) (← links)
• Squares of Intersection Graphs and Induced Matchings (Q3439440) (← links)
• On Distance-3 Matchings and Induced Matchings (Q3655145) (← links)
• Improved Induced Matchings in Sparse Graphs (Q3656857) (← links)
• Maximum Induced Matchings in Grids (Q4596162) (← links)
• (Q4691867) (← links)
• (Q4691905) (← links)
• (Q4691914) (← links)
• Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs (Q5025046) (← links)
• Well-indumatched Trees and Graphs of Bounded Girth (Q5060441) (← links)
• Parameterized Algorithms and Kernels for Rainbow Matching (Q5111288) (← 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)
• Some bounds on the maximum induced matching numbers of certain grids (Q5383192) (← links)
• Induced Matchings in Graphs of Degree at Most 4 (Q5743551) (← links)
• Distributed link scheduling in wireless networks (Q5858167) (← links)
• (Q5869351) (← links)
• Parameterized complexity of perfectly matched sets (Q6038698) (← links)
• On the parameterized complexity of the acyclic matching problem (Q6038700) (← links)
• Computational complexity aspects of super domination (Q6076353) (← links)
• Minimum number of maximal dissociation sets in trees (Q6193972) (← links)
• Multi-channel assignment and link scheduling for prioritized latency-sensitive applications (Q6536160) (← links)
• A bisection approach to subcubic maximum induced matching (Q6575400) (← links)
• Cutting Barnette graphs perfectly is hard (Q6589850) (← links)
• On the complexity of minimum maximal acyclic matchings (Q6621851) (← links)
• Polyhedral approach to weighted connected matchings in general graphs (Q6633527) (← links)
• An improved kernel and parameterized algorithm for almost induced matching (Q6636070) (← links)
• Edge open packing: complexity, algorithmic aspects, and bounds (Q6646442) (← links)