Quasi-fully dynamic algorithms for two-connectivity, cycle equivalence and related problems

Madhukar R. Korupolu and Vijaya Ramachandran
Algorithmica 33(2):168–182, Jun 2002
Proc. 5th Eur. Symp. Algorithms (ESA 1997), Lecture Notes in Computer Science 1284, Rainer Ernst Burkard and Gerhard J. Woeginger, ed., Springer-Verlag, Sep 1997, pp. 326–340

Cites:

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