779 search results - page 45 / 156 » A graph polynomial for independent sets of bipartite graphs |
121
click to vote
WG
2005
Springer
15 years 3 months ago
2005
Springer
In unweighted case, approximation ratio for the independent set problem has been analyzed in terms of the graph parameters, such as the number of vertices, maximum degree, and aver...
JCT
2008
14 years 9 months ago
2008
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max n 3 + (n - ) 3 = 1 2 + o...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
BIRTHDAY
2010
Springer
14 years 11 months ago
2010
Springer
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
SIAMJO
2008
14 years 9 months ago
2008
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....