Login / Signup
Compound Poisson approximations of subgraph counts in random graphs.
Dudley Stark
Published in:
Random Struct. Algorithms (2001)
Keyphrases
</>
random graphs
graph theoretic
phase transition
small world
learning curves
np hard
lead time
power law
complex networks
graph mining
undirected graph
attributed graphs
computational complexity
poisson process
constraint satisfaction
probability distribution
color images
search space