Asymptotic enumeration of sparse graphs with a minimum degree constraint.
Boris G. PittelNicholas C. WormaldPublished in: J. Comb. Theory, Ser. A (2003)
Keyphrases
- random graphs
- spanning tree
- search space
- graph representation
- gaussian graphical models
- directed acyclic
- sparse representation
- sparse data
- sparsity constraints
- high dimensional
- graph theoretic
- compressive sensing
- expected values
- graph matching
- asymptotically optimal
- degree distribution
- constraint graph
- laplace transform
- complex structures
- undirected graph
- power law
- weighted graph
- graph theory
- worst case
- connected dominating set