Dynamic graph algorithms{}

Joan Feigenbaum and Sampath Kannan
Handbook of Discrete & Combinatorial Mathematics, Kenneth H. Rosen, ed., CRC Press, 2000, pp. 1142–1148

Cites:

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