๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The complexity of harmonious colouring for trees

โœ Scribed by Keith Edwards; Colin McDiarmid

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
510 KB
Volume
57
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the complexity of branch-and-bound se
On the complexity of branch-and-bound search for random trees
โœ Luc Devroye; Carlos Zamora-Cura ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 256 KB ๐Ÿ‘ 2 views

Let T be a b-ary tree of height n, which has independent, non-negative, n identically distributed random variables associated with each of its edges, a model previously considered by Karp, Pearl, McDiarmid, and Provan. The value of a node is the sum of all the edge values on its path to the root. Co

The Complexity of Scheduling Trees with
The Complexity of Scheduling Trees with Communication Delays
โœ Jan Karel Lenstra; Marinus Veldhorst; Bart Veltman ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 190 KB

We consider the problem of finding a minimum-length schedule on m machines for a set of n unit-length tasks with a forest of intrees as precedence relation, and with unit interprocessor communication delays. First, we prove that this problem is NP-complete; second, we derive a linear time algorithm