Tight bounds for rumor spreading in graphs of a given conductance.

George Giakkoupis

Published in: STACS (2011)

Keyphrases

tight bounds
upper bound
graph matching
graph theory
graph representation
graph theoretic
database
directed graph
graph structure
data sets
neural network
search engine
pattern recognition
spanning tree
random graphs
labeled graphs