Offline algorithms for dynamic minimum spanning tree problems

David Eppstein
J. Algorithms 17(2):237–250, Sep 1994
Tech. report 92-04, Univ. of California, Irvine, Dept. of Information and Computer Science, 1992
Proc. 2nd Worksh. Algorithms and Data Structures (WADS 1991), Lecture Notes in Computer Science 519, Frank K. H. A. Dehne, Jörg-Rudiger Sack, and Nicola Santoro, ed., Springer-Verlag, Aug 1991, pp. 392–399
Mathematical Reviews 95e:68168
http://www.ics.uci.edu/~eppstein/pubs/Epp-TR-92-04.pdf
http://dx.doi.org/10.1006/jagm.1994.1033

Cited by:

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