Abstract
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.
Cite
CITATION STYLE
Belmonte, R., Van ’t Hof, P., & Kamiński, M. (2012). Induced immersions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7676 LNCS, pp. 299–308). Springer Verlag. https://doi.org/10.1007/978-3-642-35261-4_33
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
