Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Monika Rauch Henzinger, Johannes A. La Poutré. Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs. In Paul G. Spirakis, editor, Algorithms - ESA 95, Third Annual European Symposium, Corfu, Greece, September 25-27, 1995, Proceedings. Volume 979 of Lecture Notes in Computer Science, pages 171-184, Springer, 1995.

This author has not been identified. Look up 'Monika Rauch Henzinger' in GoogleThis author has not been identified. Look up 'Johannes A. La Poutré' in Google

runs on WebDSL