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

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

0.00 Avg rating0 Votes
Article ID: iaor1999861
Country: Netherlands
Volume: 78
Issue: 2
Start Page Number: 169
End Page Number: 177
Publication Date: Aug 1997
Journal: Mathematical Programming
Authors:
Keywords: networks, computers: data-structure
Abstract:

The dynamic tree> is an abstract data type that allows the maintenance of a collection of trees subject to joining by adding edges (linking) and splitting by deleting edges (cutting), while at the same time allowing reporting of certain combinations of vertex or edge values. For many applications of dynamic trees, values must be combined along paths. For other applications, values must be combined over entire trees. For the latter situation, an idea used originally in parallel graph algorithms, to represent trees by Euler tours, leads to a simple implementation with a time of O(log n) per tree operation, where n is the number of tree vertices. We apply this representation to the implementation of two versions of the network simplex algorithm, resulting in a time of O(log n) per pivot, where n is the number of vertices in the problem network.

Reviews

Required fields are marked *. Your email address will not be published.