Constraints for symmetry breaking in graph representation
- Submitting institution
-
University of Glasgow
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 11-02294
- Type
- D - Journal article
- DOI
-
10.1007/s10601-018-9294-5
- Title of journal
- Constraints
- Article number
- -
- First page
- 1
- Volume
- 24
- Issue
- 1
- ISSN
- 1383-7133
- Open access status
- Compliant
- Month of publication
- January
- Year of publication
- 2019
- URL
-
http://eprints.gla.ac.uk/165865/
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
3
- Research group(s)
-
-
- Citation count
- 0
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- ORIGINALITY: we present symmetry-breaking constraints to reduce the time to search for solutions to extremal graph problems from hours to fractions of a second. Such problems occur in many fields, e.g., coding and cryptography, networks, chemistry and biology. Approach is much more lightweight than existing symmetry-breaking methods. SIGNIFICANCE: we have used our constraints to solve several open instances in extremal graph theory and described extension of approach to coloured graphs. RIGOUR: we provide full mathematical proofs for the theoretical results, and extensive experimental evidence (based on 77 configurations) demonstrating the power of our approach. Preliminary version in IJCAI 2013.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -