We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

Detecting induced star-like minors in polynomial time.

Fiala, J. and Kaminksi, M. and Paulusma, Daniel (2012) 'Detecting induced star-like minors in polynomial time.', Journal of discrete algorithms., 17 . pp. 74-85.


The Induced Minor problem is to test whether a graph G contains a graph H as an induced minor, i.e., if G can be modified into H by a sequence of vertex deletions and edge contractions. When H is fixed, i.e., not part of the input, this problem is denoted H-Induced Minor. We provide polynomial-time algorithms for this problem in the case that the fixed target graph has a star-like structure. In particular, we show polynomial-time solvability for all forests H on at most seven vertices except for one such case.

Item Type:Article
Keywords:Induced minor, Tree, Computational complexity.
Full text:(AM) Accepted Manuscript
Download PDF
Publisher Web site:
Publisher statement:NOTICE: this is the author’s version of a work that was accepted for publication in Journal of discrete algorithms. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Journal of discrete algorithms, 12, 2012, 10.1016/j.jda.2012.11.002
Date accepted:No date available
Date deposited:17 April 2013
Date of first online publication:December 2012
Date first made open access:No date available

Save or Share this output

Look up in GoogleScholar