Almost Induced Matching: Linear Kernels and Parameterized Algorithms
From MaRDI portal
Publication:3181060
DOI10.1007/978-3-662-53536-3_19zbMath1417.05170OpenAlexW2526493294MaRDI QIDQ3181060
Publication date: 22 December 2016
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53536-3_19
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
Cites Work
- Unnamed Item
- Editing graphs to satisfy degree constraints: a parameterized approach
- Exact exponential algorithms.
- On the induced matching problem
- Irredundancy in circular arc graphs
- Looking at the stars
- Approximability results for the maximum and minimum maximal induced matching problems
- An improved kernelization for \(P_{2}\)-packing
- 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
- Exact algorithms for maximum induced matching
- Kernels for Packing and Covering Problems
- An Improved Exact Algorithm for Maximum Induced Matching
- Faster Algebraic Algorithms for Path and Packing Problems
- Bipartite Domination and Simultaneous Matroid Covers
- Maximum $r$-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds
- Maximal Induced Matchings in Triangle-Free Graphs
This page was built for publication: Almost Induced Matching: Linear Kernels and Parameterized Algorithms
