Login / Signup
Tight bounds for algebraic gossip on graphs.
Michael Borokhovich
Chen Avin
Zvi Lotker
Published in:
ISIT (2010)
Keyphrases
</>
tight bounds
upper bound
algebraic structures
graph matching
graph theoretic
series parallel
random walk
directed graph
graph theory
graph representation
random graphs
subgraph isomorphism
structured objects
labeled graphs