Certificates and fast algorithms for biconnectivity in fully-dynamic graphs

Monika Rauch Henzinger and Johannes A. La Poutré
Proc. 3rd Eur. Symp. Algorithms (ESA 1995), Lecture Notes in Computer Science 979, Paul G. Spirakis, ed., Springer-Verlag, Sep 1995, pp. 171–184

Cites:

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