1983 search results - page 48 / 397 » Competitive graph searches |
CONSTRAINTS
2007
13 years 7 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
ENTCS
2007
13 years 7 months ago
2007
We define a rewrite strategy for a class of non-confluent constructor-based term graph rewriting systems and discuss its correctness. Our strategy and its extension to narrowing...
MFCS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...
COR
2010
13 years 7 months ago
2010
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
IJAMCIGI
2010
13 years 2 months ago
2010
We present an experimental investigation of tabu search (TS) to solve the 3-coloring problem (3-COL). Computational results reveal that a basic TS algorithm is able to find proper ...