par Golovach, Petr A.;Kaminski, Marcin 
;Paulusma, Daniël
Référence Lecture notes in computer science, 6907 LNCS, page (339-350)
Publication Publié, 2011
;Paulusma, DaniëlRéférence Lecture notes in computer science, 6907 LNCS, page (339-350)
Publication Publié, 2011
Article révisé par les pairs
| Résumé : | The problems Contractibility and Induced Minor are to test whether a graph G contains a graph H as a contraction or as an induced minor, respectively. We show that these two problems can be solved in |
