𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The complexity of some graph colouring problems

✍ Scribed by Keith Edwards

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
896 KB
Volume
36
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the complexity of graph tree partitio
On the complexity of graph tree partition problems
✍ Roberto Cordone; Francesco Maffioli πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 270 KB

This paper concerns the optimal partition of a graph into p connected clusters of vertices, with various constraints on their topology and weight. We consider di erent objectives, depending on the cost of the trees spanning the clusters. This rich family of problems mainly applies to telecommunicati