On the induced matching problem
type: Item
instance of: scholarly article
title: On the induced matching problem
zbMATH Open document ID: 1235.05114
author: Iyad Kanj
author: Michael J. Pelsmajer
author: Marcus Schaefer
author: Ge Xia
published in: Journal of Computer and System Sciences
publication date: 2012-01-11T00:00:00Z
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2008/1361/
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 5996367
zbMATH Keywords: induced matchings
zbMATH Keywords: twinless graphs
MaRDI profile type: Publication
OpenAlex ID: W2059738021
cites work: Problems and results in extremal combinatorics. I.
cites work: Tight bounds on maximal and maximum matchings
cites work: Q4503944
cites work: Q4263467
cites work: On the approximability of the maximum induced matching problem
cites work: Q3971782
cites work: Q4857375
cites work: Q4255576
cites work: Applications of a Planar Separator Theorem
cites work: The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
cites work: Parameterized complexity of finding regular induced subgraphs
cites work: Maximum induced linear forests in outerplanar graphs
cites work: Large induced forests in triangle-free planar graphs
cites work: Q4869540
cites work: Q4944970
DOI: 10.1016/J.JCSS.2010.09.001
description: scientific article; zbMATH DE number 5996367