An improved kernel and parameterized algorithm for almost induced matching
From MaRDI portal
Publication:6636070
DOI10.1007/978-981-97-2340-9_8MaRDI QIDQ6636070
Publication date: 12 November 2024
Cites Work
- Editing graphs to satisfy degree constraints: a parameterized approach
- Exact exponential algorithms.
- On the induced matching problem
- Irredundancy in circular arc graphs
- Parameterized complexity of finding regular induced subgraphs
- The parameterized complexity of the induced matching problem
- NP-completeness of some generalizations of the maximum matching problem
- Induced matchings
- Finding maximum induced matchings in subclasses of claw-free and \(P_5\)-free graphs, and in graphs with matching and induced matching of equal maximum size
- On the approximability of the maximum induced matching problem
- New results on induced matchings
- Parameterized algorithms and kernels for almost induced matching
- Exact algorithms for maximum induced matching
- Almost Induced Matching: Linear Kernels and Parameterized Algorithms
- Bipartite Domination and Simultaneous Matroid Covers
- Maximum $r$-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds
- Graph-Theoretic Concepts in Computer Science
This page was built for publication: An improved kernel and parameterized algorithm for almost induced matching
