par Belmonte, Rémy;van 't Hof, Pim;Kaminski, Marcin 
Référence Lecture notes in computer science, 7676 LNCS, page (299-308)
Publication Publié, 2012
Référence Lecture notes in computer science, 7676 LNCS, page (299-308)
Publication Publié, 2012
Article révisé par les pairs
| Résumé : | A graph G contains a multigraph H as an induced immersion if H can be obtained from G by a sequence of vertex deletions and lifts. We present a polynomial-time algorithm that decides for any fixed multigraph H whether an input graph G contains H as an induced immersion. We also show that for every multigraph H with maximum degree at most 2, there exists a constant c H such that every graph with treewidth more than cH contains H as an induced immersion. © Springer-Verlag Berlin Heidelberg 2012. |
