The shifting algorithm technique for the partitioning of trees
- 8 September 1995
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 62 (1-3) , 15-34
- https://doi.org/10.1016/0166-218x(94)00143-2
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A shifting algorithm for constrained min-max partition on treesDiscrete Applied Mathematics, 1993
- Most uniform path partitioning and its use in image processingDiscrete Applied Mathematics, 1993
- Efficient implementation of a shifting algorithmDiscrete Applied Mathematics, 1985
- A bottom‐up algorithm for weight‐ and height‐bounded minimal partition of treesInternational Journal of Computer Mathematics, 1984
- Efficient Optimization of Monotonic Functions on TreesSIAM Journal on Algebraic Discrete Methods, 1983
- Circuit partitioning with size and connection constraintsNetworks, 1983
- Shifting algorithms for tree partitioning with general weighting functionsJournal of Algorithms, 1983
- A Shifting Algorithm for Min-Max Tree PartitioningJournal of the ACM, 1982
- Max-Min Tree PartitioningJournal of the ACM, 1981
- A Linear Tree Partitioning AlgorithmSIAM Journal on Computing, 1977