9842 search results - page 4 / 1969 » The Complexity of the Matching-Cut Problem |
CORR
2002
Springer
13 years 7 months ago
2002
Springer
Abstract. We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Constraint Satisfaction Problems (CSP) constitute a convenient way to capture many combinatorial problems. The general CSP is known to be NP-complete, but its complexity depends on...
SSWMC
2004
13 years 8 months ago
2004
We analyze the complexity of the steganography problem and show that the decision version of the problem is NP-complete through transformation from the Knapsack problem. We also g...
CATS
2008
13 years 9 months ago
2008
The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem ...
IPL
2007
13 years 7 months ago
2007
In this paper, we consider the parameterized complexity of the following problem: Given a hereditary property P on digraphs, an input digraph D and a positive integer k, does D ha...