On the communication complexity of randomized broadcasting in random-like graphs.

Robert Elsässer

Published in: SPAA (2006)

Keyphrases

computational complexity
worst case
graph matching
computational cost
graph theory
graph theoretic
np hard
graph structure
graph databases
graph kernels
subgraph isomorphism
representational power