资源分类
》 资源 》论文》Breaking Symmetries in Graph Representation Michael Codish Alice Miller and Patrick Prosser Peter J. Stuckey

Breaking Symmetries in Graph Representation Michael Codish Alice Miller and Patrick Prosser Peter J. Stuckey

2019-11-11 | |  68 |   42 |   0
Abstract 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.

上一篇：On the Complexity of Global Scheduling Constraints under Structural Restrictions

下一篇：Variable Elimination in Binary CSP via Forbidden Patterns

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...