9842 search results - page 179 / 1969 » The Complexity of the Matching-Cut Problem |
JNSM
2010
13 years 5 months ago
2010
The Internet Protocol Security Architecture IPsec is hard to deploy in large, nested, or dynamic scenarios. The major reason for this is the need for manual configuration of the cr...
TCS
2010
13 years 8 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
INFOSCALE
2007
ACM
13 years 12 months ago
2007
ACM
Problem localization is a critical part of providing crucial system management capabilities to modern distributed environments. One key open challenge is for problem localization ...
COCO
2004
Springer
14 years 2 months ago
2004
Springer
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...