| Date |
Sept 2, 2014 |
| Speaker |
Mr. Peter Floderus
|
| Title |
A polynomial to count induced subgraphs quickly
|
| Abstract |
The problem of Induced Subgraph Isomorphism has applications in several different fields. It is in some chemical contexts called "substructure search". This talk will show a novel technique of solving this via polynomial identity testing. The main focus lies on the technique of designing a polynomial from a graph which still retains the relevant information in the graph and how to exploit different representations of the same polynomial.
|
|
アブストラクト