836 search results - page 55 / 168 » Orthogonal Colorings of Graphs |
121
click to vote
JCT
2002
15 years 1 months ago
2002
It is proved that there is a function f : N N such that the following holds. Let G be a graph embedded in a surface of Euler genus g with all faces of even size and with edge-wid...
101
Voted
CP
2004
Springer
15 years 7 months ago
2004
Springer
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
140
click to vote
PPOPP
2009
ACM
16 years 2 months ago
2009
ACM
A stream processor executes an application that has been decomposed into a sequence of kernels that operate on streams of data elements. During the execution of a kernel, all stre...
DAC
1998
ACM
16 years 2 months ago
1998
ACM
We have developed a new algorithm and software for graph coloring by systematically combining several algorithm and software development ideas that had crucial impact on the algor...
201
click to vote
ICITS
2011
14 years 5 months ago
2011
In this paper, we use the concept of colored edge graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirements...