A bottom‐up algorithm for weight‐ and height‐bounded minimal partition of trees (Q3339302)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3872701
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A bottom‐up algorithm for weight‐ and height‐bounded minimal partition of trees |
scientific article; zbMATH DE number 3872701 |
Statements
A bottom‐up algorithm for weight‐ and height‐bounded minimal partition of trees (English)
0 references
1984
0 references
tree partitioning
0 references
constrained partitioning
0 references
rooted tree
0 references
bottom-up polynomial time algorithm
0 references
0.9208933
0 references
0.9181314
0 references
0.91544545
0 references
0.89914453
0 references
0 references
0.8981712
0 references
0.8973138
0 references
0.8949351
0 references
0.89129794
0 references
