• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail

On the complexity of various parameterizations of common induced subgraph isomorphism

Abu-Khzam, Faisal N.; Bonnet, Édouard; Sikora, Florian (2017), On the complexity of various parameterizations of common induced subgraph isomorphism, Theoretical Computer Science, 697, p. 69-78. 10.1016/j.tcs.2017.07.010

View/Open
155324377951581.pdf (215.3Kb)
Type
Article accepté pour publication ou publié
Date
2017
Journal name
Theoretical Computer Science
Volume
697
Publisher
Elsevier
Pages
69-78
Publication identifier
10.1016/j.tcs.2017.07.010
Metadata
Show full item record
Author(s)
Abu-Khzam, Faisal N.

Bonnet, Édouard cc

Sikora, Florian cc
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)
In 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.
Subjects / Keywords
Induced common isomorphism; Parameterized complexity; Kernelization; ETH; based lower bounds

Related items

Showing items related by title and author.

  • Thumbnail
    On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism 
    Abu-Khzam, Faisal N.; Bonnet, Édouard; Sikora, Florian (2015) Communication / Conférence
  • Thumbnail
    On the Complexity of QoS-Aware Service Selection Problem 
    Abu-Khzam, Faisal N.; Bazgan, Cristina; El Haddad, Joyce; Sikora, Florian (2015) Communication / Conférence
  • Thumbnail
    Complexity of Grundy Coloring and Its Variants 
    Bonnet, Édouard; Foucaud, Florent; Kim, Eun Jung; Sikora, Florian (2015) Communication / Conférence
  • Thumbnail
    Complexity of Grundy coloring and its variants 
    Bonnet, Édouard; Foucaud, Florent; Kim, Eun Jung; Sikora, Florian (2018) Article accepté pour publication ou publié
  • Thumbnail
    The Graph Motif problem parameterized by the structure of the input graph 
    Bonnet, Édouard; Sikora, Florian (2017) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo