Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others? - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Peter Floderus' in GoogleThis author has not been identified. Look up 'Miroslaw Kowaluk' in GoogleThis author has not been identified. Look up 'Andrzej Lingas' in GoogleThis author has not been identified. Look up 'Eva-Marta Lundell' in Google

runs on WebDSL