On the induced matching problem in Hamiltonian bipartite graphs
From MaRDI portal
Publication:2059914
DOI10.1515/gmj-2021-2090OpenAlexW3131123246MaRDI QIDQ2059914
Publication date: 13 December 2021
Published in: Georgian Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.0864
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Parameterized dominating set problem in chordal graphs: Complexity and lower bound
- The parameterized complexity of the induced matching problem
- Approximating maximum independent sets by excluding subgraphs
- Approximation algorithms for combinatorial problems
- Induced matchings in intersection graphs.
- Spider web networks: a family of optimal, fault tolerant, Hamiltonian bipartite graphs
- On the approximability of the maximum induced matching problem
- Finding a maximum induced matching in weakly chordal graphs
- The complexity of irredundant sets parameterized by size
- Maximum Matching in Multi-Interface Networks
- The importance of being biased
- Linear FPT reductions and computational lower bounds
- The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
- Efficient algorithms for finding maximum matching in graphs
- Approximation algorithms for NP-complete problems on planar graphs
- Fixed-Parameter Tractability and Completeness I: Basic Results
- On the Induced Matching Problem
- Improved Parameterized Upper Bounds for Vertex Cover
This page was built for publication: On the induced matching problem in Hamiltonian bipartite graphs
