Publication:4910736
From MaRDI portal
DOI10.4230/LIPIcs.STACS.2008.1361zbMath1259.68095MaRDI 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
68Q25: Analysis of algorithms and problem complexity
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
68W99: Algorithms in computer science
Related Items
Improved induced matchings in sparse graphs, Linear kernelizations for restricted 3-Hitting Set problems, The parameterized complexity of the induced matching problem, On the induced matching problem in Hamiltonian bipartite graphs, Safe Approximation and Its Relation to Kernelization, Bidimensionality and Kernels, Improved Induced Matchings in Sparse Graphs