Fully dynamic algorithms for bounded genus graphs

Monika Rauch Henzinger, Louis Ibarra, and Valerie King
Tech. report DCS-261-IR, Univ. of Victoria, Computer Science Dept., 1997
http://facweb.cs.depaul.edu/ibarra/papers/genus.ps

Cites:

• Improved sparsification
• Sparsification — A technique for speeding up dynamic graph algorithms
• Separator based sparsification I: planarity testing and minimum spanning trees
• Maintenance of a minimum spanning forest in a dynamic planar graph