9842 search results - page 318 / 1969 » The Complexity of the Matching-Cut Problem |
148
click to vote
ISAAC
2007
Springer
15 years 10 months ago
2007
Springer
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...
136
click to vote
SARA
2007
Springer
15 years 10 months ago
2007
Springer
Constraint Programming is a powerful approach for modeling and solving many combinatorial problems, scalability, however, remains an issue in . Abstraction and reformulation techni...
125
click to vote
STACS
2007
Springer
15 years 10 months ago
2007
Springer
We contribute to the study of efficient enumeration algorithms for all solutions of constraint satisfaction problems. The only algorithm known so far, presented by Creignou and H´...
122
click to vote
DSN
2006
IEEE
15 years 10 months ago
2006
IEEE
Fault-tolerant time-triggered communication relies on the synchronization of local clocks. The startup problem is the problem of reaching a sufficient degree of synchronization a...
123
click to vote
CP
2005
Springer
15 years 9 months ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...