The shifting algorithm technique for the partitioning of trees
type: Item
instance of: scholarly article
title: The shifting algorithm technique for the partitioning of trees
zbMATH Open document ID: 0833.68088
DOI: 10.1016/0166-218X(94)00143-2
author: Yehoshua Perl
author: Ronald I. Becker
published in: Discrete Applied Mathematics
publication date: 1995-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 806405
zbMATH Keywords: shifting algorithm technique
zbMATH Keywords: top-down greedy technique
describes a project that uses: PERL
MaRDI profile type: Publication
cites work: A shifting algorithm for constrained min-max partition on trees
cites work: Shifting algorithms for tree partitioning with general weighting functions
cites work: A bottom‐up algorithm for weight‐ and height‐bounded minimal partition of trees
cites work: Q4198056
cites work: Q4083452
cites work: Parallel concepts in graph theory
cites work: Q4142699
cites work: Most uniform path partitioning and its use in image processing
cites work: Max-Min Tree Partitioning
cites work: Efficient Optimization of Monotonic Functions on Trees
cites work: Circuit partitioning with size and connection constraints
cites work: Efficient implementation of a shifting algorithm
cites work: Q4772687
description: scientific article; zbMATH DE number 806405