Induced Subtrees in Interval Graphs [chapter]

Pinar Heggernes, Pim van 't Hof, Martin Milanič
2013 Lecture Notes in Computer Science  
The Induced Subtree Isomorphism problem takes as input a graph G and a tree T , and the task is to decide whether G has an induced subgraph that is isomorphic to T . This problem is known to be NP-complete on bipartite graphs, but it can be solved in polynomial time when G is a forest. We show that Induced Subtree Isomorphism can be solved in polynomial time when G is an interval graph. In contrast to this positive result, we show that the closely related Subtree Isomorphism problem is
more » ... te even when G is restricted to the class of proper interval graphs, a well-known subclass of interval graphs.
doi:10.1007/978-3-642-45278-9_20 fatcat:yddoddstejeohk5nb4v3zc5uvu