617 search results - page 34 / 124 » On the Chromatic Number of Random Graphs |
IWOCA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...
APPROX
2004
Springer
15 years 5 months ago
2004
Springer
A simple first moment argument shows that in a randomly chosen k-SAT formula with m clauses over n boolean variables, the fraction of satisfiable clauses is 1−2−k +o(1) as m/...
WEA
2005
Springer
15 years 5 months ago
2005
Springer
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
COMBINATORICA
2008
14 years 10 months ago
2008
Algorithms are given for computing the number of n-element diagonal sets and the number of n-element strongly diagonal sets of binary sequences of length at most 2n - 2. The first...
DM
2010
14 years 12 months ago
2010
For graphs of bounded maximum degree, we consider acyclic t-improper colourings, that is, colourings in which each bipartite subgraph consisting of the edges between two colour cl...