Symmetry breaking constraints for the minimum deficiency problem
From MaRDI portal
Recommendations
- A comparison of integer and constraint programming models for the deficiency problem
- Lower bounds and a tabu search algorithm for the minimum deficiency problem
- Constraints for symmetry breaking in graph representation
- Integer programming formulations for minimum deficiency interval coloring
- Branch-cut-and-propagate for the maximum k-colorable subgraph problem with symmetry
Cites work
- A comparison of integer and constraint programming models for the deficiency problem
- A note on the graph isomorphism counting problem
- Consecutive colorings of the edges of general graphs
- scientific article; zbMATH DE number 3823850 (Why is no real title available?)
- scientific article; zbMATH DE number 1004939 (Why is no real title available?)
- scientific article; zbMATH DE number 1772585 (Why is no real title available?)
- scientific article; zbMATH DE number 951847 (Why is no real title available?)
- scientific article; zbMATH DE number 1409249 (Why is no real title available?)
- Interval coloring of (3,4)-biregular bipartite graphs having large cubic subgraphs
- Investigation on interval edge-colorings of graphs
- Lower bounds and a tabu search algorithm for the minimum deficiency problem
- On interval colourings of bi-regular bipartite graphs
- On interval edge colorings of ( , )-biregular bipartite graphs
- On the deficiency of bipartite graphs
- Practical graph isomorphism. II.
- Symmetry definitions for constraint satisfaction problems
- The complexity of symmetry-breaking formulas
- The deficiency of a regular graph
This page was built for publication: Symmetry breaking constraints for the minimum deficiency problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2971392)
