Breaking symmetries with high dimensional graph invariants and their combination

DOI10.1007/978-3-031-33271-5_10OpenAlexW4377249535MaRDI QIDQ6057256

Avraham Itzhakov, Michael Codish

Publication date: 4 October 2023

Published in: Integration of Constraint Programming, Artificial Intelligence, and Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-33271-5_10

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Edge decomposition of connected claw-free cubic graphs
• Conflict-driven answer set solving: from theory to practice
• Constraints for symmetry breaking in graph representation
• Practical graph isomorphism. II.
• Generating effective symmetry-breaking predicates for search problems
• Numbers of cubic graphs
• General Symmetry Breaking Constraints
• Cataloguing the graphs on 10 vertices
• Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
• Fast generation of regular graphs and construction of cages
• Fast generation of cubic graphs
• Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems
• The Generation of Fullerenes

This page was built for publication: Breaking symmetries with high dimensional graph invariants and their combination