1952 search results - page 86 / 391 » Complete partitions of graphs |
154
click to vote
CP
2005
Springer
15 years 11 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...
166
click to vote
ICIP
2006
IEEE
16 years 7 months ago
2006
IEEE
This paper describes a technique for generating partition sequences of regions presenting long-term homogeneity in color and motion coherency in terms of affine models. The techni...
157
click to vote
KR
2004
Springer
15 years 11 months ago
2004
Springer
Simple Conceptual Graphs (SGs) are used to represent entities and relations between these entities: they can be translated into positive, conjunctive, existential first-order log...
152
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely...
181
click to vote
IPL
2007
15 years 6 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...