Random Walks, Bisections and Gossiping in Circulant Graphs. Mans, B. & Shparlinski, I. Algorithmica, 70(2):301-325, 2014.
Random Walks, Bisections and Gossiping in Circulant Graphs. [link]Link  Random Walks, Bisections and Gossiping in Circulant Graphs. [link]Paper  bibtex   
@article{ journals/algorithmica/MansS14,
  added-at = {2014-07-31T00:00:00.000+0200},
  author = {Mans, Bernard and Shparlinski, Igor},
  biburl = {http://www.bibsonomy.org/bibtex/22a0f15c30c0ab0ec747b350584f737b6/dblp},
  ee = {http://dx.doi.org/10.1007/s00453-013-9810-3},
  interhash = {c123cf3860a328b6e5d393c44016f22f},
  intrahash = {2a0f15c30c0ab0ec747b350584f737b6},
  journal = {Algorithmica},
  keywords = {dblp},
  number = {2},
  pages = {301-325},
  title = {Random Walks, Bisections and Gossiping in Circulant Graphs.},
  url = {http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica70.html#MansS14},
  volume = {70},
  year = {2014}
}

Downloads: 0