Affiliation:
1. School of Electronics and Information Science , Jiangsu University of Science and Technology , Zhenjiang , Jiangsu 212003 , P. R. China
Abstract
Abstract
In this paper, we study the parameterized complexity
of the induced matching problem in hamiltonian bipartite graphs and the inapproximability of
the maximum induced matching problem in hamiltonian bipartite graphs.
We show that, given a hamiltonian bipartite graph,
the induced matching problem is W[1]-hard and cannot be solved in time
n
o
(
k
)
{n^{o(\sqrt{k})}}
,
where n is the number of vertices in the graph, unless the 3SAT
problem can be solved in subexponential time. In addition,
we show that unless
NP
=
P
{\operatorname{NP}=\operatorname{P}}
, a maximum induced matching in a hamiltonian bipartite graph cannot be approximated within a ratio of
n
1
/
4
-
ϵ
{n^{1/4-\epsilon}}
,
where n is the number of vertices in the graph.
Reference29 articles.
1. B. S. Baker,
Approximation algorithms for NP-complete problems on planar graphs,
J. Assoc. Comput. Mach. 41 (1994), no. 1, 153–180.
2. N. L. Biggs, E. K. Lloyd and R. J. Wilson,
Graph Theory: 1736–1936,
Clarendon Press, Oxford, 1976.
3. R. Boppana and M. M. Halldórsson,
Approximating maximum independent sets by excluding subgraphs,
BIT 32 (1992), no. 2, 180–196.
4. K. Cameron,
Induced matchings in intersection graphs,
Discrete Math. 278 (2004), no. 1–3, 1–9.
5. K. Cameron, R. Sritharan and Y. Tang,
Finding a maximum induced matching in weakly chordal graphs,
Discrete Math. 266 (2003), 133–142.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. $$\mathcal {P}$$-Matchings Parameterized by Treewidth;Graph-Theoretic Concepts in Computer Science;2023