Understanding the Complexity of Induced Subgraph Isomorphisms

  • Yijia Chen
  • Marc Thurley
  • Mark Weyer
Conference paper

DOI: 10.1007/978-3-540-70575-8_48

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5125)
Cite this paper as:
Chen Y., Thurley M., Weyer M. (2008) Understanding the Complexity of Induced Subgraph Isomorphisms. In: Aceto L., Damgård I., Goldberg L.A., Halldórsson M.M., Ingólfsdóttir A., Walukiewicz I. (eds) Automata, Languages and Programming. ICALP 2008. Lecture Notes in Computer Science, vol 5125. Springer, Berlin, Heidelberg

Abstract

We study left-hand side restrictions of the induced subgraph isomorphism problem: Fixing a class Open image in new window, for given graphs GOpen image in new window and arbitrary H we ask for induced subgraphs of H isomorphic to G.

For the homomorphism problem this kind of restriction has been studied by Grohe and Dalmau, Kolaitis and Vardi for the decision problem and by Dalmau and Jonsson for its counting variant.

We give a dichotomy result for both variants of the induced subgraph isomorphism problem. Under some assumption from parameterized complexity theory, these problems are solvable in polynomial time if and only if Open image in new window contains no arbitrarily large graphs.

All classifications are given by means of parameterized complexity. The results are presented for arbitrary structures of bounded arity which implies, for example, analogous results for directed graphs.

Furthermore, we show that no such dichotomy is possible in the sense of classical complexity. That is, if Open image in new window there are classes Open image in new window such that the induced subgraph isomorphism problem on Open image in new window is neither in Open image in new window nor Open image in new window-complete. This argument may be of independent interest, because it is applicable to various parameterized problems.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Yijia Chen
    • 1
  • Marc Thurley
    • 2
  • Mark Weyer
    • 2
  1. 1.BASICS, Department of Computer ScienceShanghai Jiaotong UniversityShanghaiChina
  2. 2.Institut für InformatikHumboldt-Universität zu BerlinBerlinGermany

Personalised recommendations