A bottom‐up algorithm for weight‐ and height‐bounded minimal partition of trees (Q3339302): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A shifting algorithm for constrained min-max partition on trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Shifting Algorithm for Min-Max Tree Partitioning / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Partitioning trees: Matching, domination, and maximum diameter / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Linear Tree Partitioning Algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Max-Min Tree Partitioning / rank | |||
Normal rank | |||
Latest revision as of 13:02, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A bottom‐up algorithm for weight‐ and height‐bounded minimal partition of trees |
scientific article |
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
