Breaking Symmetries with High Dimensional Graph Invariants and Their Combination

Avraham Itzhakov, Michael Codish

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper illustrates the application of graph invariants to break symmetries for graph search problems. The paper makes two contributions: (1) the use of higher dimensional graph invariants in symmetry breaking constraints; and (2) a novel technique to obtain symmetry breaking constraints by combining graph invariants. Experimentation demonstrates that the proposed approach applies to provide new results for the generation of a particular class of cubic graphs.

Original languageEnglish
Title of host publicationIntegration of Constraint Programming, Artificial Intelligence, and Operations Research - 20th International Conference, CPAIOR 2023, Proceedings
EditorsAndre A. Cire
PublisherSpringer Science and Business Media Deutschland GmbH
Pages133-149
Number of pages17
ISBN (Print)9783031332708
DOIs
StatePublished - 1 Jan 2023
Event20th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, CPAIOR 2023 - Nice, France
Duration: 29 May 20231 Jun 2023

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume13884 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference20th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, CPAIOR 2023
Country/TerritoryFrance
CityNice
Period29/05/231/06/23

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'Breaking Symmetries with High Dimensional Graph Invariants and Their Combination'. Together they form a unique fingerprint.

Cite this