On the induced matching problem in Hamiltonian bipartite graphs
type: Item
instance of: scholarly article
title: On the induced matching problem in Hamiltonian bipartite graphs
author: Yinglei Song
published in: Georgian Mathematical Journal
publication date: 2021-12-13T00:00:00Z
full work available at URL: https://arxiv.org/abs/1412.0864
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 7442620
zbMATH Keywords: induced matching
zbMATH Keywords: Hamiltonian bipartite graphs
zbMATH Keywords: parameterized complexity
zbMATH Keywords: inapproximability
MaRDI profile type: Publication
OpenAlex ID: W3131123246
cites work: Approximation algorithms for NP-complete problems on planar graphs
cites work: Q4101844
cites work: Approximating maximum independent sets by excluding subgraphs
cites work: Induced matchings in intersection graphs.
cites work: Finding a maximum induced matching in weakly chordal graphs
cites work: Linear FPT reductions and computational lower bounds
cites work: Improved Parameterized Upper Bounds for Vertex Cover
cites work: The importance of being biased
cites work: Fixed-Parameter Tractability and Completeness I: Basic Results
cites work: Fixed-parameter tractability and completeness II: On completeness for W[1]
cites work: The complexity of irredundant sets parameterized by size
cites work: On the approximability of the maximum induced matching problem
cites work: Efficient algorithms for finding maximum matching in graphs
cites work: Q4198056
cites work: Approximation algorithms for combinatorial problems
cites work: On the Induced Matching Problem
cites work: Spider web networks: a family of optimal, fault tolerant, Hamiltonian bipartite graphs
cites work: Maximum Matching in Multi-Interface Networks
cites work: Parameterized dominating set problem in chordal graphs: Complexity and lower bound
cites work: Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs
cites work: The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
cites work: The parameterized complexity of the induced matching problem
cites work: Q4527015
cites work: Q4944970
DOI: 10.1515/GMJ-2021-2090
description: scientific article; zbMATH DE number 7442620