Sciweavers

765 search results - page 26 / 153
» Graph Coloring with Rejection
Sort
View
JCT
2006
80views more  JCT 2006»
13 years 8 months ago
Extending precolorings to circular colorings
Fix positive integers k , d , k, d such that k /d > k/d 2. If P is a set of vertices in a (k, d)-colorable graph G, and any two vertices of P are separated by distance at leas...
Michael O. Albertson, Douglas B. West
APPROX
2009
Springer
107views Algorithms» more  APPROX 2009»
14 years 3 months ago
Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs
We consider the problem of aligned coloring of interval and chordal graphs. These problems have substantial applications to register allocation in compilers and have recently been ...
Douglas E. Carroll, Adam Meyerson, Brian Tagiku
PDPTA
2003
13 years 10 months ago
A Design for Node Coloring and 1-Fair Alternator on de Bruijn Networks
In this paper, we study the coloring problem for the undirected binary de Bruijn interconnection network. The coloring scheme is simple and fast. We propose the coloring algorithm...
Jyh-Wen Mao, Chang-Biau Yang
CAAN
2006
Springer
14 years 11 days ago
Scheduling of a Smart Antenna: Capacitated Coloring of Unit Circular-Arc Graphs
We consider scheduling problems that are motivated by an optimization of the transmission schedule of a smart antenna. In these problems we are given a set of messages and a confl...
Guy Even, Shimon Shahar
DAM
2006
124views more  DAM 2006»
13 years 8 months ago
Coloring copoints of a planar point set
To a set of n points in the plane, one can associate a graph that has less than n2 vertices and has the property that k-cliques in the graph correspond vertex sets of convex k-gon...
Walter Morris