Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm

Robert E. Tarjan
Mathematical Programming 78(2):169–177, Aug 1997

Cites:

Maintenance of a minimum spanning forest in a dynamic planar graph

Fano Experimental Web Server, D. Eppstein, School of Information & Computer Science, UC Irvine