The Shifting Algorithm Technique for the Partitioning of Trees

Abstract In this paper we survey a design technique for partitioning on trees. This technique, the shifting algorithm technique, is a top-down greedy technique. A partition of a tree is represented by associating cuts with edges of the tree. The basic operation of the technique is a local transformation called a shift of a cut from an edge to an adjacent edge of the tree. We review several shifting algorithms for different optimization criteria for partitioning. In these algorithms, different shifts and different greedy decisions are utilized. A mathematical framework created for validity proofs of shifting algorithms is introduced. Various applications are outlined.

[1]  M. Malik,et al.  Operating Systems , 1992, Lecture Notes in Computer Science.

[2]  Stephen R. Schach,et al.  A Shifting Algorithm for Min-Max Tree Partitioning , 1980, JACM.

[3]  Frank Harary,et al.  Graph Theory , 2016 .

[4]  Yehoshua Perl,et al.  Circuit partitioning with size and connection constraints , 1983, Networks.

[5]  Sukhamay Kundu,et al.  A Linear Tree Partitioning Algorithm , 1977, SIAM J. Comput..

[6]  Stephen R. Schach,et al.  A Bottom-Up Algorithm for Weight- and Height-Bounded Minimal Partitions of Trees , 1984, CAAP.

[7]  Gerard Salton,et al.  Automatic Information Organization And Retrieval , 1968 .

[8]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[9]  Yehoshua Perl,et al.  Shifting Algorithms for Tree Partitioning with General Weighting Functions , 1983, J. Algorithms.

[10]  Yehoshua Perl,et al.  A Shifting Algorithm for Constrained min-max Partition on Trees , 1993, Discret. Appl. Math..

[11]  Y. Shiloach,et al.  Efficient Optimization of Monotonic Functions on Trees , 1983 .

[12]  Raymond E. Miller,et al.  Complexity of Computer Computations , 1972 .

[13]  Yehoshua Perl,et al.  Most Uniform Path Partitioning and its Use in Image Processing , 1993, Discret. Appl. Math..

[14]  Uzi Vishkin,et al.  Efficient implementation of a shifting algorithm , 2018, Discret. Appl. Math..

[15]  Yehoshua Perl,et al.  Efficient Optimization of Monotonic Functions on Trees , 1981, CAAP.

[16]  Stephen R. Schach,et al.  Max-Min Tree Partitioning , 1981, JACM.