Asymptotic enumeration of full graphs.
Daniel J. KleitmanFernando R. LasagaLenore J. CowenPublished in: J. Graph Theory (1995)
Keyphrases
- search space
- graph matching
- graph theoretic
- graph theory
- graph partitioning
- graph mining
- dynamic programming
- data sets
- random graphs
- directed graph
- bipartite graph
- asymptotically optimal
- graph structures
- graph databases
- graph construction
- graph representation
- series parallel
- undirected graph
- spanning tree
- graph structure
- social network analysis
- computational complexity
- bayesian networks
- genetic algorithm