On the complexity of various parameterizations of common induced subgraph isomorphism

  title={On the complexity of various parameterizations of common induced subgraph isomorphism},
  author={Faisal N. Abu-Khzam and {\'E}douard Bonnet and Florian Sikora},
  booktitle={Theor. Comput. Sci.},

Figures from this paper

Beyond Distributed Subgraph Detection: Induced Subgraphs, Multicolored Problems and Graph Parameters

This work presents lower bounds and parameterized algorithms w.r.t structural parameters of the input graph, and shows that induced paths can be detected fast in CONGEST using techniques from parameterization algorithms, while detecting cycles and patterns of treewidth 2 is hard.

Streaming Deletion Problems Parameterized by Vertex Cover

This work takes a parameterized approach by assuming a vertex cover of the graph is given, building on work of Bishnu et al.

Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree

This work considers the maximum common connected edge subgraph problem and themaximum common connected induced sub graph problem for simple graphs with labeled vertices (or labeled edges) and concludes that the former is to be solved and the latter is not.

A genetic approach to the maximum common subgraph problem

A simple yet effective genetic algorithm that finds quickly a solution, subject to possible geometric constraints, in the problem of finding the maximum common subgraph of a pair of given graphs.

Chemical Similarity and Substructure Searches



Maximum common induced subgraph parameterized by vertex cover

  • F. Abu-Khzam
  • Mathematics, Computer Science
    Inf. Process. Lett.
  • 2014

The parameterized complexity of the induced matching problem

Short Cycles Make W-hard Problems Hard: FPT Algorithms for W-hard Problems in Graphs with no Short Cycles

Abstract We show that several problems that are hard for various parameterized complexity classes on general graphs, become fixed parameter tractable on graphs with no small cycles. More

Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs

This paper gives a kO(dk)n time algorithm for finding a dominating set of size at most k in a d-degenerated graph with n vertices, which proves that the dominating set problem is fixed-parameter tractable for degenerated graphs.

Cleaning Interval Graphs

The NP-hardness of the Induced Subgraph Isomorphism problem is shown, and fixed-parameter tractability of the problem with non-standard parameterization is proved, where the parameter is the difference |V(G)|−|V(H)|.

Deciding first-order properties of nowhere dense graphs

It is shown that deciding properties of graphs definable in first-order logic is fixed-parameter tractable on nowhere dense graph classes, and a "rank-preserving" version of Gaifman's locality theorem is proved.

Algorithmic Aspects of Dominator Colorings in Graphs

It is shown that unless P=NP, DC cannot be solved in polynomial time on bipartite, planar, or split graphs and that the problem is fixed parameter tractable (FPT) on chordal graphs and in graphs which exclude a fixed apex graph as a minor.

Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems

A new randomized method, random separation, for solving fixed-cardinality optimization problems on graphs, i.e., problems concerning solutions with exactly a fixed number k of elements that optimize solution values is developed.

Known algorithms on graphs of bounded treewidth are probably optimal

Lower bounds on the running time of algorithms solving problems on graphs of bounded treewidth are obtained and the results under the Strong Exponential Time Hypothesis of Impagliazzo and Paturi are proved.