Dynamic trees as search trees via euler tours, applied to the network simplex algorithm
- 352 Downloads
Thedynamic 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(logn) per tree operation, wheren 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(logn) per pivot, wheren is the number of vertices in the problem network.
KeywordsSearch Tree Tree Operation Dynamic Tree Minimum Cost Flow Euler Tour
Unable to display preview. Download preview PDF.
- G.M. Adel’son-Vel’skii and E.M. Landis, An algorithm for the organization of information,Soviet Math. Dokl. 3 (1962) 1259–1262.Google Scholar
- R.F. Cohen and R. Tamassia, Dynamic expression trees and their applications,Proc. 2nd ACM-SIAM Symposium on Discrete Algorithms (1991) 52–61.Google Scholar
- D. Eppstein, G.F. Italiano, R. Tamassia, R.E. Tarjan, J. Westbrook and M. Yung, Maintenance of a minimum spanning forest in a dynamic planar graph,Proc. 1st ACM-SIAM Symp. on Discrete Algorithms (1990) 1–11.Google Scholar
- G.N. Frederickson, Ambivalent data structures for dynamic 2-edge-connectivity andk smallest spanning trees,Proc. 32nd IEEE Symp. on Foundations of Computer Science (1991) 632–641.Google Scholar
- L.J. Guibas and R. Sedgewick, A dichromatic framework for balanced trees,Proc. 19th Annual IEEE Symposium on Foundations of Computer Science (1978) 8–21.Google Scholar
- M.R. Henzinger and V. King, Randomized dynamic graph algorithms with polylogarithmic time per operation,Proc. 27th Annual ACM Symp. on Theory of Computing (1995) 519–527.Google Scholar
- G.L. Miller and J.H. Reif, Parallel tree contraction and its application,Proc. 26th Annual IEEE Symp. on Foundations of Comp. Sci. (1985) 478–489.Google Scholar
- J.B. Orlin, A polynomial time primal network simplex algorithm for minimum cost flows (an extended abstract),Proc. 7th ACM-SIAM Symp. on Discrete Algorithms (1996) 474–481.Google Scholar
- R.E. Tarjan, Data Structures and Network Algorithms,CBMS 44, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983.Google Scholar