Computing the number of induced copies of a fixed graph in a bounded degree graph.
Viresh PatelGuus RegtsPublished in: CoRR (2017)
Keyphrases
- bounded degree
- graph theoretic
- random walk
- graph model
- homology generators
- fixed number
- spanning tree
- graph structure
- structured data
- undirected graph
- weighted graph
- graph representation
- directed graph
- edge weights
- random graphs
- bounded treewidth
- computational complexity
- machine learning
- graph matching
- graph theory
- np complete
- special case
- connected graphs