9842 search results - page 150 / 1969 » The Complexity of the Matching-Cut Problem |
DAM
2006
13 years 10 months ago
2006
The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs...
EOR
2007
13 years 10 months ago
2007
In this note we study the tool switching problem with non-uniform tool sizes. More specifically, we consider the problem where the job sequence is given as part of the input. We ...
HEURISTICS
2010
13 years 5 months ago
2010
The challenge in shift scheduling lies in the construction of a set of work shifts, which are subject to specific regulations, in order to cover fluctuating staff demands. This pro...
IWOCA
2010
Springer
13 years 5 months ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
ESEM
2008
ACM
14 years 23 hour ago
2008
ACM
Some agile voices have been raised against extensive documentation. They advocate its sparse use and production. In this paper, we report from agile evolution and maintenance tren...