186
click to vote
EJC
10 years 22 days ago
2016 
First-fit is the online graph coloring algorithm that considers vertices one at a time in some order and assigns each vertex the least positive integer not used already on a neigh...
111
click to vote
EJC
10 years 22 days ago
2016 
Abstract. Building on recent results regarding symmetric probabilistic constructions of countable structures, we provide a method for constructing probability measures, concentrate...
118
click to vote
EJC
10 years 22 days ago
2016
Let C(n) denote the maximum number of induced copies of C5 in graphs on n vertices. For n large enough, we show that C(n) = a · b · c · d · e + C(a) + C(b) + C(c) + C(d) + C(e...
106
click to vote
EJC
10 years 22 days ago
2016 
The well known dichotomy conjecture of Feder and Vardi states that for every family Γ of constraints CSP(Γ) is either polynomially solvable or NP-hard. Bulatov and Jeavons reform...
|
Information Technology