Almost Induced Matching: Linear Kernels and Parameterized Algorithms

Author(s):  
Mingyu Xiao ◽  
Shaowei Kou
2014 ◽  
Vol 36 (9) ◽  
pp. 1868-1879
Author(s):  
Wei-Zhong LUO ◽  
Qi-Long FENG ◽  
Jian-Xin WANG ◽  
Jian-Er CHEN

2020 ◽  
Vol 16 (3) ◽  
pp. 1-31
Author(s):  
Daniel Lokshtanov ◽  
Fahad Panolan ◽  
Saket Saurabh ◽  
Roohani Sharma ◽  
Meirav Zehavi

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Yinglei Song

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.


2014 ◽  
Vol 11 (2) ◽  
pp. 1-31 ◽  
Author(s):  
Daniel Lokshtanov ◽  
N. S. Narayanaswamy ◽  
Venkatesh Raman ◽  
M. S. Ramanujan ◽  
Saket Saurabh

2006 ◽  
Vol 3 (4) ◽  
pp. 423-432 ◽  
Author(s):  
Yinglei Song ◽  
Chunmei Liu ◽  
Xiuzhen Huang ◽  
Russell Malmberg ◽  
Ying Xu ◽  
...  

2007 ◽  
Vol Vol. 9 no. 1 (Graph and Algorithms) ◽  
Author(s):  
Olivier Togni

Graphs and Algorithms International audience The strong chromatic index of a graph is the minimum number of colours needed to colour the edges in such a way that each colour class is an induced matching. In this paper, we present bounds for strong chromatic index of three different products of graphs in term of the strong chromatic index of each factor. For the cartesian product of paths, cycles or complete graphs, we derive sharper results. In particular, strong chromatic indices of d-dimensional grids and of some toroidal grids are given along with approximate results on the strong chromatic index of generalized hypercubes.


Author(s):  
Vahan Mkrtchyan ◽  
Garik Petrosyan ◽  
K. Subramani ◽  
Piotr Wojciechowski

Sign in / Sign up

Export Citation Format

Share Document