Lower bounds for fully dynamic connectivity problems in graphs

Monika Rauch Henzinger and Michael L. Fredman
Algorithmica 22(3):351–362, Nov 1998

Cites:

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