Symmetry Breaking Constraints for the Minimum Deficiency Problem

DOI10.7155/jgaa.00412zbMath1358.05089OpenAlexW2574603786MaRDI QIDQ2971392

Sivan Altinakar, Alain Hertz, Gilles Caporossi

Publication date: 5 April 2017

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00412

zbMATH Keywords

\textsc{gamblle} constraints

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A comparison of integer and constraint programming models for the deficiency problem
• The complexity of symmetry-breaking formulas
• Lower bounds and a tabu search algorithm for the minimum deficiency problem
• Symmetry definitions for constraint satisfaction problems
• On interval edge colorings of \((\alpha ,\beta )\)-biregular bipartite graphs
• A note on the graph isomorphism counting problem
• On the deficiency of bipartite graphs
• Investigation on interval edge-colorings of graphs
• Practical graph isomorphism. II.
• The deficiency of a regular graph
• Interval coloring of (3,4)-biregular bipartite graphs having large cubic subgraphs
• Consecutive colorings of the edges of general graphs

This page was built for publication: Symmetry Breaking Constraints for the Minimum Deficiency Problem