Cite

HARVARD Citation

    Borokhovich, M. et al. (2014). Bounds for algebraic gossip on graphs1. Random structures & algorithms. 45 (2), pp. 185-217. [Online]. 
  
Back to record