9842 search results - page 260 / 1969 » The Complexity of the Matching-Cut Problem |
129
click to vote
CORR
2010
Springer
15 years 27 days ago
2010
Springer
: Given two testable properties P1 and P2, under what conditions are the union, intersection or set-difference of these two properties also testable? We initiate a systematic study...
139
Voted
ERSHOV
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We consider the problem of query containment for conjunctive queries with safe negation property. A necessary and sufficient condition for two queries to be in containmen...
154
click to vote
FCT
2005
Springer
15 years 9 months ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
122
Voted
MFCS
2004
Springer
15 years 8 months ago
2004
Springer
We study constructive and resource-bounded scaled dimension as an information content measure and obtain several results that parallel previous work on unscaled dimension. Scaled ...
DAGM
2003
Springer
15 years 8 months ago
2003
Springer
Optimal labeling problems are NP-hard in many practically important cases. Sufficient conditions for optimal label detection in every pixel are formulated. Knowing the values of th...