Randomized fully dynamic graph algorithms with polylogarithmic time per operation

Monika Rauch Henzinger and Valerie King
J. ACM 46(4):502–516, Jul 1999
Proc. 27th Symp. Theory of Computing, ACM, May 1995, pp. 519–527

Cites:

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