2398 search results - page 6 / 480 » Constraint Programming and Graph Algorithms |
149
click to vote
CP
2006
Springer
15 years 9 months ago
2006
Springer
The problem of finding a graceful labelling of a graph, or proving that the graph is not graceful, has previously been modelled as a CSP. A new and much faster CSP model of the pro...
147
Voted
CP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. This article presents a database of about 200 graph invariants for deriving systematically necessary conditions from the graph properties based representation of global c...
149
Voted
CP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In an increasing number of domains such as bioinformatics, combinatorial graph problems arise. We propose a novel way to solve these problems, mainly those that can be tr...
180
click to vote
IEEEPACT
1997
IEEE
15 years 9 months ago
1997
IEEE
† In this paper, we propose a parallel randomized algorithm, called Parallel Fast Assignment using Search Technique (PFAST), for scheduling parallel programs represented by direc...