Finding all the best swaps of a minimum diameter spanning tree under transient edge failures

Enrico Nardelli, Guido Proietti, and Peter Widmayer
Proc. 6th Eur. Symp. Algorithms (ESA 1998), Lecture Notes in Computer Science 1461, Gianfranco Bilardi, Giuseppe F. Italiano, Andrea Pietracaprina, and Geppino Pucci, ed., Springer-Verlag, Aug 1998, pp. 55–66

Cites:

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine
Made on a Mac Valid XHTML 1.0!