An exact threshold theorem for random graphs and the node-packing problem.
Geoffrey R. GrimmettPublished in: J. Comb. Theory, Ser. B (1986)
Keyphrases
- packing problem
- random graphs
- undirected graph
- graph theoretic
- learning curves
- integer programming
- phase transition
- directed graph
- arbitrary shaped
- small world
- complex networks
- graph theory
- link prediction
- directed acyclic graph
- reinforcement learning
- community structure
- constraint programming
- heuristic search
- tree structure
- random walk
- np complete
- objective function