836 search results - page 83 / 168 » Orthogonal Colorings of Graphs |
137
click to vote
CC
2006
Springer
15 years 7 months ago
2006
Springer
As register allocation is one of the most important phases in optimizing compilers, much work has been done to improve its quality and speed. We present a novel register allocation...
145
Voted
IWOCA
2009
Springer
15 years 10 months ago
2009
Springer
: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...
106
Voted
DM
2000
15 years 3 months ago
2000
A graph is said to be representable modulo n if its vertices can be labelled with distinct integers between 0 and n - 1 inclusive such that two vertices are adjacent if and only i...
150
Voted
SASO
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper we study desynchronization, a closelyrelated primitive to graph coloring. A valid graph coloring is an assignment of colors to nodes such that no node’s color is t...
130
click to vote
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...