On the Induced Matching Problem
From MaRDI portal
Publication:4910736
DOI10.4230/LIPIcs.STACS.2008.1361zbMath1259.68095OpenAlexW2128097206MaRDI QIDQ4910736
Michael J. Pelsmajer, Marcus Schaefer, Ge Xia, Iyad A. Kanj
Publication date: 19 March 2013
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_0ffe.html
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) Algorithms in computer science (68W99)
Related Items (8)
Safe Approximation and Its Relation to Kernelization ⋮ A Retrospective on (Meta) Kernelization ⋮ Improved induced matchings in sparse graphs ⋮ Linear kernelizations for restricted 3-Hitting Set problems ⋮ Bidimensionality and Kernels ⋮ On the induced matching problem in Hamiltonian bipartite graphs ⋮ The parameterized complexity of the induced matching problem ⋮ Improved Induced Matchings in Sparse Graphs
This page was built for publication: On the Induced Matching Problem
