This study is motivated by the following problem: Given data situated at the vertices of a tree, to efficiently partition it into pages. In a recent paper a criterion was proposed as follows: Perform the partition so that the largest page is as small as possible. However, it would be desirable to allow further criteria to be taken into account in the partitioning. We give two examples.
|Original language||English (US)|
|Number of pages||4|
|State||Published - Dec 1 1982|
All Science Journal Classification (ASJC) codes