836 search results - page 62 / 168 » Orthogonal Colorings of Graphs |
112
click to vote
IPL
2008
15 years 4 months ago
2008
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
118
click to vote
SIAMDM
2008
15 years 4 months ago
2008
The first-fit chromatic number of a graph is the number of colors needed in the worst case of a greedy coloring. It is also called the Grundy number, which is defined to be the max...
139
Voted
MICCAI
2006
Springer
16 years 5 months ago
2006
Springer
110
Voted
STOC
2003
ACM
16 years 4 months ago
2003
ACM
CPM
2009
Springer
15 years 10 months ago
2009
Springer