Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others?

Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell. Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others?. In Joachim Gudmundsson, Julián Mestre, Taso Viglas, editors, Computing and Combinatorics - 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012. Proceedings. Volume 7434 of Lecture Notes in Computer Science, pages 37-48, Springer, 2012. [doi]

Abstract

Abstract is missing.