Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness.
Marc RothJohannes SchmittPublished in: CoRR (2018)
Keyphrases
- topological information
- phase transition
- data structure
- topological spaces
- learning theory
- topological properties
- d objects
- graph databases
- genetic algorithm
- geometric objects
- np complete
- np hard
- computational complexity
- neural network
- information theoretic
- spatial information
- graph mining
- worst case
- graph structures
- lower bound