Abstract
The Induced Subgraph Isomorphism problem on two input graphs G and H is to decide whether G has an induced subgraph isomorphic to H. Already for the restricted case where H is a complete graph the problem is NP-complete, as it is then equivalent to the Clique problem. In a recent paper [7] Marx and Schlotter show that Induced Subgraph Isomorphism is NP-complete when G and H are restricted to be interval graphs. They also show that the problem is W[1]-hard with this restriction when parametrised by the number of vertices in H. In this paper we show that when G is an interval graph and H is a connected proper interval graph, the problem is solvable in polynomial time. As a more general result, we show that when G is an interval graph and H is an arbitrary proper interval graph, the problem is fixed parameter tractable when parametrised by the number of connected components of H. To complement our results, we prove that the problem remains NP-complete when G and H are both proper interval graphs and H is disconnected.
This work is supported by the Deutsche Forschungsgemeinschaft and by the Research Council of Norway.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Booth, K.S., Lueker, G.S.: A linear time algorithm for deciding interval graph isomorphism. Journal of the ACM 26, 183–195 (1979)
Cai, L., Chan, S.M., Chan, S.O.: Random separation: A new method for solving fixed-cardinality optimization problems. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 239–250. Springer, Heidelberg (2006)
Eppstein, D.: Subgraph isomorphism in planar graphs and related problems. J. Graph Algorithms Appl. 3(3), 1–27 (1999)
Fulkerson, D.R., Gross, O.A.: Incidence matrices and interval graphs. Pacific Journal of Mathematics 15, 835–855 (1965)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman & Co., New York (1979)
Looges, P.J., Olariu, S.: Optimal greedy algorithms for indifference graphs. Computers & Mathematics with Applications 25, 15–25 (1993)
Marx, D., Schlotter, I.: Cleaning Interval Graphs. arXiv:1003.1260v1 (2010)
Matula, D.W.: Subtree isomorphism in O(n 5/2). Ann. Discrete Math. 2, 91–106 (1978)
Olariu, S.: An optimal greedy heuristic to color interval graphs. Information Processing Letters 37, 21–25 (1991)
Roberts, F.S.: Indifference Graphs. In: Proof Techniques in Graph Theory, pp. 139–146. Academic Press, New York (1969)
Sipser, M.: Introduction to the Theory of Computation. International Thomson Publishing (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Heggernes, P., Meister, D., Villanger, Y. (2010). Induced Subgraph Isomorphism on Interval and Proper Interval Graphs. In: Cheong, O., Chwa, KY., Park, K. (eds) Algorithms and Computation. ISAAC 2010. Lecture Notes in Computer Science, vol 6507. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17514-5_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-17514-5_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17513-8
Online ISBN: 978-3-642-17514-5
eBook Packages: Computer ScienceComputer Science (R0)