Breaking Symmetries in Graph Representation
نویسندگان
چکیده
There are many complex combinatorial problems which involve searching for an undirected graph satisfying a certain property. These problems are often highly challenging because of the large number of isomorphic representations of a possible solution. In this paper we introduce novel, effective and compact, symmetry breaking constraints for undirected graph search. While incomplete, these prove highly beneficial in pruning the search for a graph. We illustrate the application of symmetry breaking in graph representation to resolve several open instances in extremal graph theory.
منابع مشابه
Symmetry Breaking in Subgraph Pattern Matching
Graph pattern matching, a central application in many fields, can be modelled as a CSP. This CSP approach can be competitive with dedicated algorithms. In this paper, we develop symmetry breaking techniques for subgraph matching in order to increase the number of tractable instances. Specific detection techniques are first developed for the classical variables symmetries and value symmetries. I...
متن کاملGroup-graphs associated with Row and Column Symmetries of Matrix Models: some observations
The effect of symmetry-breaking constraints is often evaluated empirically. In order to understand which symmetric configurations are removed by a set of constraints, we have to understand the underlying structure of the symmetry group in concern. A class of symmetry that frequently occurs in constraint programming is the row and column symmetries of a matrix model. In this paper, we study thes...
متن کاملSyMT: finding symmetries in SMT formulas
The QF UF category of the SMT-LIB test set contains many formulas with symmetries, and breaking these symmetries results in an important speedup [8]. This paper presents SyMT, a tool to find and report symmetries in SMT formulas. SyMT is based on the reduction of the problem of detecting symmetries in formulas to finding automorphisms in a graph representation of these formulas. The output of S...
متن کاملSpeeding up SAT solver by exploring CNF symmetries : Revisited
Boolean Satisfiability solvers have gone through dramatic improvements in their performances and scalability over the last few years by considering symmetries. It has been shown that by using graph symmetries and generating symmetry breaking predicates (SBPs) it is possible to break symmetries in Conjunctive Normal Form (CNF). The SBPs cut down the search space to the nonsymmetric regions of th...
متن کاملAlmost-symmetries of Graphs
Many successful uses of symmetries in discrete computational problems rely on group-theoretical properties. Almost-symmetries can be more numerous, but do not have the same properties. In this work, we study almost-symmetries of graphs, proposing data structures for representing them, algorithms for finding them, and logic predicates for symmetry-breaking.
متن کامل