Martin Milanič: Induced subtrees in interval graphs
Datum objave: 5. 11. 2013
Seminar za teorijo grafov in algoritme
Četrtek 7. 11. 2013 ob 12:15 v 3.05 na Jadranski 21
Povzetek: 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 NP-complete even when G is restricted to the class of proper interval graphs, a well-known subclass of interval graphs.
Joint work with Pinar Heggernes and Pim van 't Hof (both from University of Bergen).
