Show simple item record

dc.contributor.authorAbu-Khzam, Faisal N
dc.contributor.authorBonnet, Édouard
dc.contributor.authorSikora, Florian
dc.date.accessioned2019-03-22T09:13:47Z
dc.date.available2019-03-22T09:13:47Z
dc.date.issued2017
dc.identifier.issn0304-3975
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/18547
dc.language.isoenen
dc.subjectInduced common isomorphismen
dc.subjectParameterized complexityen
dc.subjectKernelizationen
dc.subjectETHen
dc.subjectbased lower boundsen
dc.subject.ddc003en
dc.titleOn the complexity of various parameterizations of common induced subgraph isomorphismen
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenIn the Maximum Common Induced Subgraph problem (henceforth MCIS), given two graphs G1 and G2, one looks for a graph with the maximum number of vertices being both an induced subgraph of G1 and G2. MCIS is among the most studied classical NP-hard problems. It remains NP-hard on many graph classes including forests. In this paper, we study the parameterized complexity of MCIS. As a generalization of Clique, it is W[1]-hard parameterized by the size of the solution. Being NP-hard even on forests, most structural parameterizations are intractable. One has to go as far as parameterizing by the size of the minimum vertex cover to get some tractability. Indeed, when parameterized by k := vc(G1)+vc(G2) the sum of the vertex cover number of the two input graphs, the problem was shown to be fixed-parameter tractable, with an algorithm running in time 2o(klogk). We complement this result by showing that, unless the ETH fails, it cannot be solved in time 2o(klogk). This kind of tight lower bound has been shown for a few problems and parameters but, to the best of our knowledge, not for the vertex cover number. We also show that MCIS does not have a polynomial kernel when parameterized by k, unless NP⊆coNP/poly. Finally, we study MCIS and its connected variant MCCIS on some special graph classes and with respect to other structural parameters.en
dc.relation.isversionofjnlnameTheoretical Computer Science
dc.relation.isversionofjnlvol697en
dc.relation.isversionofjnldate2017-10
dc.relation.isversionofjnlpages69-78en
dc.relation.isversionofdoi10.1016/j.tcs.2017.07.010en
dc.relation.isversionofjnlpublisherElsevieren
dc.subject.ddclabelRecherche opérationnelleen
dc.relation.forthcomingnonen
dc.relation.forthcomingprintnonen
dc.description.ssrncandidatenonen
dc.description.halcandidateouien
dc.description.readershiprechercheen
dc.description.audienceInternationalen
dc.relation.Isversionofjnlpeerreviewedouien
dc.relation.Isversionofjnlpeerreviewedouien
dc.date.updated2019-03-22T08:45:29Z
hal.person.labIds161210
hal.person.labIds7449
hal.person.labIds989
hal.identifierhal-02076432*


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record