Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time

Free registration required

Executive Summary

In this paper, the authors look at a variant of the standard vertex coloring problem that they name graph multicoloring. Given an n-node graph G = (V, E), the goal is to assign a set Sv of colors to each node v ?? V such that the color sets Su and Sv of two adjacent nodes u ?? V and v ?? V are disjoint while at the same time, the fraction of colors assigned to each node is as large as possible and the total number of colors used is as small as possible.

  • Format: PDF
  • Size: 188.05 KB