Finding and Counting Small Induced Subgraphs Efficiently

Ton Kloks, Dieter Kratsch, Haiko Müller. Finding and Counting Small Induced Subgraphs Efficiently. In Manfred Nagl, editor, Graph-Theoretic Concepts in Computer Science, 21st International Workshop, WG 95, Aachen, Germany, June 20-22, 1995, Proceedings. Volume 1017 of Lecture Notes in Computer Science, pages 14-23, Springer, 1995.

Abstract

Abstract is missing.