An improved kernel and parameterized algorithm for almost induced matching
From MaRDI portal
Publication:6636070
DOI10.1007/978-981-97-2340-9_8MaRDI QIDQ6636070FDOQ6636070
Authors: Yuxi Liu, Mingyu Xiao 
Publication date: 12 November 2024
Cites Work
- Exact exponential algorithms.
- Parameterized complexity of finding regular induced subgraphs
- Induced matchings
- Editing graphs to satisfy degree constraints: a parameterized approach
- The parameterized complexity of the induced matching problem
- NP-completeness of some generalizations of the maximum matching problem
- 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
- Maximum \(r\)-regular induced subgraph problem: fast exponential algorithms and combinatorial bounds
- On the approximability of the maximum induced matching problem
- New results on induced matchings
- Graph-Theoretic Concepts in Computer Science
- Bipartite Domination and Simultaneous Matroid Covers
- On the induced matching problem
- Parameterized algorithms and kernels for almost induced matching
- Exact algorithms for maximum induced matching
- Almost induced matching: linear kernels and parameterized algorithms
- Irredundancy in circular arc graphs
This page was built for publication: An improved kernel and parameterized algorithm for almost induced matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6636070)
