Sciweavers

248 search results - page 8 / 50
» On the Cayley isomorphism problem
Sort
View
AMAI
2004
Springer
14 years 3 months ago
Symmetry Breaking in Constraint Satisfaction with Graph-Isomorphism: Comma-Free Codes
In this paper the use of graph isomorphism is investigated within the framework of symmetry breaking in constraint satisfaction problems. A running example of Comma-free codes is ...
Justin Pearson
EVOW
2005
Springer
14 years 4 months ago
Ant Algorithm for the Graph Matching Problem
This paper describes a new Ant Colony Optimization (ACO) algorithm for solving Graph Matching Problems, the goal of which is to find the best matching between vertices of multi-la...
Olfa Sammoud, Christine Solnon, Khaled Ghéd...
ECCC
2006
99views more  ECCC 2006»
13 years 10 months ago
On the Subgroup Distance Problem
We investigate the computational complexity of finding an element of a permutation group H Sn with a minimal distance to a given Sn, for different metrics on Sn. We assume that...
Christoph Buchheim, Peter J. Cameron, Taoyang Wu
MFCS
2009
Springer
14 years 3 months ago
Representing Groups on Graphs
In this paper we first explore the group theoretic techniques developed for graph isomorphism. We specifically discuss the techniques developed by Luks for solving constrained v...
Sagarmoy Dutta, Piyush P. Kurur
EXPCS
2007
14 years 2 months ago
Performance testing of combinatorial solvers with isomorph class instances
Combinatorial optimization problems expressed as Boolean constraint satisfaction problems (BCSPs) arise in several contexts, ranging from the classical unate set-packing problems ...
Franc Brglez, Jason A. Osborne