1302 search results - page 41 / 261 » On the Strong Chromatic Number |
148
click to vote
DAM
2008
15 years 5 months ago
2008
A digraph D is strong if it contains a directed path from x to y for every choice of vertices x, y in D. We consider the problem (MSSS) of finding the minimum number of arcs in a ...
159
click to vote
SWAT
2004
Springer
15 years 11 months ago
2004
Springer
Given a set of rectangles we are asked to pack as many of them as possible into a bigger rectangle. The rectangles packed may not overlap and may not be rotated. This problem is NP...
167
click to vote
ICTAI
2006
IEEE
16 years 9 days ago
2006
IEEE
In this paper a new approach for computing Strong Backdoor sets of boolean formula in conjunctive normal form (CNF) is proposed. It makes an original use of local search technique...
180
click to vote
SAGT
2010
Springer
15 years 4 months ago
2010
Springer
We consider the computational complexity of coalitional solution concepts in scenarios related to load balancing such as anonymous and congestion games. In congestion games, Paret...
150
click to vote
ICTAI
2007
IEEE
16 years 18 days ago
2007
IEEE
Domain filtering local consistencies, such as inverse consistencies, that only delete values and do not add new constraints are particularly useful in Constraint Programming. Alt...