Reconstructing the number of copies of a valency-labeled finite graph in an infinite graph.
A. J. H. KingC. St. J. A. Nash-WilliamsPublished in: J. Graph Theory (1994)
Keyphrases
- graph representation
- random walk
- graph theory
- graph mining
- graph structure
- graph model
- structured data
- bipartite graph
- finite number
- directed graph
- connected components
- small number
- random graphs
- directed acyclic graph
- computational complexity
- bounded degree
- graph data
- connected graphs
- real numbers
- edge weights
- data sets
- graph theoretic
- undirected graph
- weighted graph
- similarity measure
- graph partitioning
- graph clustering
- graph construction
- training set
- dependency graph
- labeled graphs
- polynomial time complexity
- training data