Date |
May 7, 2013 |
Speaker |
Dr. Andrzej Lingas, Lund University, Sweden
|
Title |
Counting and detecting small subgraphs via equations
|
Abstract |
We present a general technique for detecting and counting small
subgraphs. It consists in forming special linear combinations of
the numbers of occurrences of different induced subgraphs of fixed
size in a graph. These combinations can be efficiently computed by
rectangular matrix multiplication.
[Joint work with Miroslaw Kowaluk and Eva-Marta Lundell.]
|
|