5473 search results - page 214 / 1095 » On the graph isomorphism problem |
185
click to vote
IPCO
2007
15 years 8 months ago
2007
We introduce orbital branching, an effective branching method for integer programs containing a great deal of symmetry. The method is based on computing groups of variables that a...
206
click to vote
WG
2004
Springer
16 years 16 days ago
2004
Springer
Abstract. Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wish to partition G into connected components...
213
click to vote
CSL
2007
Springer
16 years 1 months ago
2007
Springer
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...
188
click to vote
AAAI
2006
15 years 8 months ago
2006
The scalability of graph-search algorithms can be greatly extended by using external memory, such as disk, to store generated nodes. We consider structured duplicate detection, an...
210
click to vote
COCOON
2005
Springer
16 years 22 days ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...