Bounded incremental computation

G. Ramalingam
Lecture Notes in Computer Science, Springer-Verlag, 1996
Ph.D. thesis, Univ. of Wisconsin, Madison, Computer Sciences Dept., 1993
Tech. report 1172, Univ. of Wisconsin, Madison, Computer Sciences Dept., 1993

Cites:

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