Random 4-regular graphs have 3-star decompositions asymptotically almost surely.
Michelle DelcourtLuke PostlePublished in: Eur. J. Comb. (2018)
Keyphrases
- central limit theorem
- graph matching
- graph theory
- graph databases
- graph theoretic
- sample size
- graph structure
- graph mining
- uniformly distributed
- undirected graph
- structured objects
- subgraph isomorphism
- decomposition methods
- asymptotically optimal
- small world
- graph representation
- databases
- complex networks
- object recognition
- bayesian networks