686 search results - page 4 / 138 » Packing Cycles in Graphs |
DM
2010
14 years 9 months ago
2010
ALGORITHMICA
2011
14 years 4 months ago
2011
FCT
2007
Springer
15 years 1 months ago
2007
Springer
We study the multi-dimensional version of the bin packing problem with conflicts. We are given a set of squares V = {1, 2, . . . , n} with sides s1, s2, . . . , sn [0, 1] and a co...
ICALP
2001
Springer
15 years 1 months ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
COLING
2000
14 years 10 months ago
2000
We propose an algorithm for the trausfer of packed linguistic structures, that is, finite collections of labelled graphs which share certain subparts. A labelled graph is seen as ...