Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness.
Marc RothJohannes SchmittPublished in: IPEC (2018)
Keyphrases
- topological information
- data structure
- topological properties
- learning theory
- computational complexity
- np complete
- phase transition
- np hard
- connected components
- frequent subgraph mining
- topological spaces
- neural network
- information theoretic
- random walk
- graph mining
- spatial information
- worst case
- connected subgraphs