Using local adaptations to reconfigure a spanning tree of a network

The paper defines the notion of a local adaptation of a spanning tree in a biconnected graph, and consider the number of local adaptations required to reconfigure the spanning tree. It shows that ⌈n/2⌉⌈n/2-1⌉/2 local adaptations are sufficient, and may be necessary, to make a node a leaf in the spanning tree, that n²/8+o(n²) local adaptations are sufficient, and may be necessary, to add or delete an edge from the spanning tree, and that 3n²/4+o(n²) local adaptations are sufficient to transform one spanning tree to another spanning tree.