2738 search results - page 88 / 548 » The Frobenius Problem and Its Generalizations |
DM
2010
14 years 10 months ago
2010
A general (rectangular) partition is a partition of a rectangle into an arbitrary number of non-overlapping subrectangles. This paper examines vertex colorings using four colors o...
ALGORITHMICA
2010
14 years 9 months ago
2010
We consider a graph with n vertices, and p < n pebbles of m colors. A pebble move consists of transferring a pebble from its current host vertex to an adjacent unoccupied verte...
116
click to vote
LICS
2012
IEEE
13 years 7 days ago
2012
IEEE
—We show that if a finite relational structure has a near unanimity polymorphism, then the constraint satisfaction problem with that structure as its fixed template has bounded...
IPCO
2004
14 years 11 months ago
2004
We study the convex hull of the feasible set of the semi-continuous knapsack problem, in which the variables belong to the union of two intervals. Besides being important in its o...
ECOOPW
1999
Springer
15 years 2 months ago
1999
Springer
Unwanted effects of aliasing cause encapsulation problems in object oriented programming. Nevertheless, aliasing is part of common and efficient programming techniques for expres...