• Citer

Detecting induced star-like minors in polynomial time

par Fiala, Jiří;Kaminski, Marcin ;Paulusma, Daniël
Référence Journal of discrete algorithms, 17, page (74-85)
Publication Publié, 2012-12

Article révisé par les pairs

• Accès en ligne
• Détails
• Contenu
• Statistiques

Résumé :

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. © 2012 Elsevier B.V. All rights reserved.