Graph Imperfection

Abstract

We are interested in colouring a graph G=(V, E) together with an integral weight or demand vector x=(xv : v # V) in such a way that xv colours are assigned to each node v, adjacent nodes are coloured with disjoint sets of colours, and we use as few colours as possible. Such problems arise in the design of cellular communication systems, when radio channels… (More)
DOI: 10.1006/jctb.2001.2042

4 Figures and Tables

Topics

  • Presentations referencing similar topics