A Distributed Algorithm for Finding all Best Swap Edges of a Minimum–Diameter Spanning Tree. Gfeller, B., Santoro, N., & Widmayer, P. IEEE Transactions on Dependable and Secure Computing, 8(1):1-12, 2011.
A Distributed Algorithm for Finding all Best Swap Edges of a Minimum–Diameter Spanning Tree [link]Paper  doi  bibtex   
@ARTICLE{Gfeller2011Jo,
  author = {Beat Gfeller and Nicola Santoro and Peter Widmayer},
  title = {{A} {D}istributed {A}lgorithm for {F}inding all {B}est {S}wap {E}dges
	of a {M}inimum--{D}iameter {S}panning {T}ree},
  journal = {IEEE Transactions on Dependable and Secure Computing},
  year = {2011},
  volume = {8},
  pages = {1-12},
  number = {1},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  doi = {http://dx.doi.org/10.1109/TDSC.2009.17},
  url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4815273}
}

Downloads: 0