Matching and covering the vertices of a random graph by copies of a given graph.

Andrzej Rucinski

Published in: Discret. Math. (1992)

Keyphrases

random graphs
graph theoretic
undirected graph
phase transition
vertex set
power law
graph matching
small world
bayesian networks
maximum matching
complex networks
search algorithm
k means
cellular automata
high throughput