Finding all the best swaps of a minimum diameter spanning tree under transient edge failures.
Nardelli, Enrico ; Proietti, Guido ; Widmayer, Peter
Journal of Graph Algorithms and Applications, Tome 5 (2001), p. 39-57 / Harvested from The Electronic Library of Mathematics
Full (PDF)
Publié le : 2001-01-01
EUDML-ID : urn:eudml:doc:49186 
@article{01668937,
     title = {Finding all the best swaps of a minimum diameter spanning tree under transient edge failures.},
     journal = {Journal of Graph Algorithms and Applications},
     volume = {5},
     year = {2001},
     pages = {39-57},
     zbl = {0985.68042},
     language = {en},
     url = {http://dml.mathdoc.fr/item/01668937}
}

Nardelli, Enrico; Proietti, Guido; Widmayer, Peter. Finding all the best swaps of a minimum diameter spanning tree under transient edge failures.. Journal of Graph Algorithms and Applications, Tome 5 (2001) pp. 39-57. http://gdmltest.u-ga.fr/item/01668937/