Constraints for symmetry breaking in graph representation
Open Access
- 25 August 2018
- journal article
- research article
- Published by Springer Nature in Constraints
- Vol. 24 (1) , 1-24
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- New families of graphs without short cycles and large sizeDiscrete Applied Mathematics, 2010
- Generating effective symmetry-breaking predicates for search problemsDiscrete Applied Mathematics, 2007
- On Extremal Unicyclic Molecular Graphs with Prescribed Girth and Minimal Hosoya IndexJournal of Mathematical Chemistry, 2006
- State of the art of graph-based data miningACM SIGKDD Explorations Newsletter, 2003
- Exploiting symmetries within constraint satisfaction search☆☆This paper is an extended and updated version of [16], presented at the IJCAI-99 conference.Artificial Intelligence, 2001
- Using simulated annealing to construct extremal graphsDiscrete Mathematics, 2001
- Isomorphism, Automorphism Partitioning, and Canonical Labeling Can Be Solved in Polynomial-Time for Molecular GraphsJournal of Chemical Information and Computer Sciences, 1998
- Extremal graphs without three‐cycles or four‐cyclesJournal of Graph Theory, 1993
- Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations1978
- On the maximal triangle-free edge-chromatic graphs in three colorsJournal of Combinatorial Theory, 1968