Asymptotic Enumeration Of Graphs With A Given Upper Bound On The Maximum Degree.
Brendan D. McKayIan M. WanlessNicholas C. WormaldPublished in: Comb. Probab. Comput. (2002)
Keyphrases
- upper bound
- worst case
- lower bound
- minimum distance
- random graphs
- closed form expressions
- branch and bound algorithm
- branch and bound
- directed graph
- graph theory
- error probability
- series parallel
- data sets
- dynamic programming
- search space
- neural network
- graph model
- sample complexity
- maximum number
- graph partitioning
- power law
- approximation algorithms
- image segmentation
- degree distribution