Poly-logarithmic deterministic fully-dynamic graph algorithms I: connectivity and minimum spanning tree

Jacob Holm, Kristian de Lichtenberg, and Mikkel Thorup
Tech. report DIKU-TR-97/17, Univ. of Copenhagen, Dept. of Computer Science, Sep 1997
http://www.diku.dk/research/published/97-17.ps.gz

Cites:

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