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 (2001)
- Volume: 5, Issue: 5, page 39-57
- ISSN: 1526-1719
Access Full Article
top
How to cite
topNardelli, Enrico, Proietti, Guido, and Widmayer, Peter. "Finding all the best swaps of a minimum diameter spanning tree under transient edge failures.." Journal of Graph Algorithms and Applications 5.5 (2001): 39-57. <http://eudml.org/doc/49186>.
@article{Nardelli2001,
author = {Nardelli, Enrico, Proietti, Guido, Widmayer, Peter},
journal = {Journal of Graph Algorithms and Applications},
keywords = {minimum diameter spanning tree; network communication systems},
language = {eng},
number = {5},
pages = {39-57},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {Finding all the best swaps of a minimum diameter spanning tree under transient edge failures.},
url = {http://eudml.org/doc/49186},
volume = {5},
year = {2001},
}
TY - JOUR
AU - Nardelli, Enrico
AU - Proietti, Guido
AU - Widmayer, Peter
TI - Finding all the best swaps of a minimum diameter spanning tree under transient edge failures.
JO - Journal of Graph Algorithms and Applications
PY - 2001
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 5
IS - 5
SP - 39
EP - 57
LA - eng
KW - minimum diameter spanning tree; network communication systems
UR - http://eudml.org/doc/49186
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.