Fully Dynamic Graph Algorithms and their Data Structures

Monika H. Rauch
Ph.D. thesis, Princeton Univ., Dept. of Computer Science, 1992
Tech. report TR-402-92, Princeton Univ., Dept. of Computer Science, Jan 1993
http://ncstrl.cs.princeton.edu/expand.php3?id=TR-402-92

Cites:

• Maintenance of a minimum spanning forest in a dynamic planar graph
• Sparsification — A technique for speeding up dynamic graph algorithms