483 search results - page 4 / 97 » On perfectness of sums of graphs |
SIAMDM
2008
14 years 10 months ago
2008
We consider the class of graphs that contain no bull, no odd hole, and no antihole of length at least five. We present a new algorithm that colors optimally the vertices of every g...
84
Voted
STACS
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
STOC
2001
ACM
15 years 10 months ago
2001
ACM
We consider the problem of partitioning n integers chosen randomly between 1 and 2m into two subsets such that the discrepancy, the absolute value of the difference of their sums,...
86
Voted
GC
2007
Springer
14 years 10 months ago
2007
Springer
The pre-coloring extension problem consists, given a graph G and a set of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of co...
71
Voted
MOC
2000
14 years 10 months ago
2000
Let (n) denote the sum of positive divisors of the natural number n. Such a number is said to be perfect if (n) = 2n. It is well known that a number is even and perfect if and only...