A bottom‐up algorithm for weight‐ and height‐bounded minimal partition of trees

DOI10.1080/00207168408803439zbMath0547.68066OpenAlexW2047135136MaRDI QIDQ3339302

Stephen R. Schach, Ronald I. Becker

Publication date: 1984

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168408803439

zbMATH Keywords

rooted treetree partitioningbottom-up polynomial time algorithmconstrained partitioning

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

The shifting algorithm technique for the partitioning of trees

Cites Work

• A shifting algorithm for constrained min-max partition on trees
• Max-Min Tree Partitioning
• Partitioning trees: Matching, domination, and maximum diameter
• A Shifting Algorithm for Min-Max Tree Partitioning
• A Linear Tree Partitioning Algorithm

This page was built for publication: A bottom‐up algorithm for weight‐ and height‐bounded minimal partition of trees