Finding all the Best Swaps of a Minimum Diameter Spanning Tree under Transient Edge Failures. Nardelli, E., Proietti, G., & Widmayer, P. Journal of Graph Algorithms and Applications, 5, No. 5:39-57, 2001.
bibtex   
@ARTICLE{NardelliPW2001J,
  author = {E. Nardelli and G. Proietti and P. Widmayer},
  title = {{F}inding all the {B}est {S}waps of a {M}inimum {D}iameter {S}panning
	{T}ree under {T}ransient {E}dge {F}ailures.},
  journal = {Journal of Graph Algorithms and Applications},
  year = {2001},
  volume = {5, No. 5},
  pages = {39-57}
}

Downloads: 0