8825 search results - page 170 / 1765 » All for one or one for all |
138
click to vote
RSA
2008
15 years 27 days ago
2008
: Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using k colors so that neighboring vertices get different colors. The first player ...
118
click to vote
GC
2010
Springer
14 years 12 months ago
2010
Springer
The b-chromatic number of a graph G is the largest integer k such that G admits a proper k-coloring in which every color class contains at least one vertex adjacent to some vertex...
124
click to vote
IPL
2010
14 years 12 months ago
2010
Control dependence forms the basis for many program analyses, such as program slicing. Recent work on control dependence analysis has led to new definitions of dependence that cat...
JSC
2010
14 years 12 months ago
2010
1 We present a solution to the conjugacy decision problem and the conjugacy search problem2 in Garside groups, which is theoretically simpler than the usual one, with no loss of eï...
100
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
ly correct bijection between higher-order abstract syntax (HOAS) and the natural numbers enables one to define a "not equals" relationship between terms and also to have ...