Before revision:  We show algorithms that require fewer rounds to update a solution to problems such as Minimum Spanning Forest  and Maximal Matching than would be required by their static counterparts to compute it from scratch.
After revision:  We show algorithms that require fewer rounds to update a solution to problems such as Minimum Spanning Forest , 2-Edge Connected Components, and Maximal Matching than would be required by their static counterparts to compute it from scratch.