9842 search results - page 255 / 1969 » The Complexity of the Matching-Cut Problem |
95
Voted
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
86
Voted
ISAAC
2007
Springer
15 years 6 months ago
2007
Springer
We design a faster algorithm for the k-maximum sub-array problem under the conventional RAM model, based on distance matrix multiplication (DMM). Specifically we achieve O(n3 log ...
90
Voted
EMO
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. In this paper, we propose an approach for solving hierarchical multi-objective optimization problems (MOPs). In realistic MOPs, two main challenges have to be considered:...
CCA
2005
Springer
15 years 2 months ago
2005
Springer
If one wishes to find out whether a computational problem over discrete data is solvable or how complex it is, the classical approach is to represent the discrete objects in quest...
110
Voted
DAGSTUHL
2006
15 years 2 months ago
2006
Abstract. The Galois connection involving polymorphisms and coclones has received a lot of attention in regard to constraint satisfaction problems. However, it fails if we are inte...