1097 search results - page 82 / 220 » Testing Graph Isomorphism |
IPCO
2007
14 years 11 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...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
The paper is organized as a self-contained literate Prolog program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmetic...
CSB
2005
IEEE
15 years 3 months ago
2005
IEEE
Searching genomes for RNA secondary structure with computational methods has become an important approach to the annotation of non-coding RNAs. However, due to the lack of effici...
DM
2008
14 years 10 months ago
2008
In this paper we study sequential dynamical systems (SDS) over words. Our main result is the classification of SDS over words for fixed graphY and family of local maps (Fvi ) by m...
STACS
2007
Springer
15 years 4 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...