9842 search results - page 233 / 1969 » The Complexity of the Matching-Cut Problem |
CASC
2006
Springer
14 years 2 months ago
2006
Springer
In this paper, we deal with the problem of the computation of the homology of a finite simplicial complex after an "elementary simplicial perturbation" process such as th...
HIS
2008
14 years 7 days ago
2008
In this paper, we highlight the use of synthetic data sets to analyze learners behavior under bounded complexity. We propose a method to generate synthetic data sets with a specif...
DGCI
2006
Springer
14 years 2 months ago
2006
Springer
This paper deals with the complexity of the decomposition of a digital surface into digital plane segments (DPS for short). We prove that the decision problem (does there exist a ...
INFORMATICALT
2006
13 years 10 months ago
2006
We study single machine scheduling problems, where processing times of the jobs are exponential functions of their start times. For increasing functions, we prove strong NP-hardnes...
HEURISTICS
2007
13 years 10 months ago
2007
In this paper, we develop and discuss several distance measures for permutation type representations of solutions of combinatorial optimisation problems. The problems discussed in...