A bottom‐up algorithm for weight‐ and height‐bounded minimal partition of trees
- 1 January 1984
- journal article
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 16 (4) , 211-228
- https://doi.org/10.1080/00207168408803439
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A Shifting Algorithm for Min-Max Tree PartitioningJournal of the ACM, 1982
- Partitioning trees: Matching, domination, and maximum diameterInternational Journal of Parallel Programming, 1981
- Max-Min Tree PartitioningJournal of the ACM, 1981
- A Linear Tree Partitioning AlgorithmSIAM Journal on Computing, 1977
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969