Breaking instance-independent symmetries in exact graph coloring

被引：0
|
作者：
Ramani, Arathi [1 ]
Markov, Igor L. [1 ]
Sakallah, Karem A. [1 ]
Aloul, Fadi A. [2 ]
机构：
[1] Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI, United States
[2] Department of Computer Engineering, American University in Sharjah, United Arab Emirates
来源：
Journal of Artificial Intelligence Research | 2006年 / 26卷
关键词：
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems; such as graph coloring used in register allocation. Graph coloring is also used to model more traditional CSPs relevant to AI; such as planning; time-tabling and scheduling. Provably optimal solutions may be desirable for commercial and defense applications. Additionally; for applications such as register allocation and code optimization; naturally-occurring instances of graph coloring are often small and can be solved optimally. A recent wave of improvements in algorithms for Boolean satisfiability (SAT) and 0-1 Integer Linear Programming (ILP) suggests generic problem-reduction methods; rather than problem-specific heuristics; because (1) heuristics may be upset by new constraints; (2) heuristics tend to ignore structure; and (3) many relevant problems are provably inapproximable. Problem reductions often lead to highly symmetric SAT instances; and symmetries are known to slow down SAT solvers. In this work; we compare several avenues for symmetry breaking; in particular when certain kinds of symmetry are present in all generated instances. Our focus on reducing CSPs to SAT allows us to leverage recent dramatic improvement in SAT solvers and automatically benefit from future progress. We can use a variety of black-box SAT solvers without modifying their source code because our symmetry-breaking techniques are static; i.e; we detect symmetries and add symmetry breaking predicates (SBPs) during pre-processing. An important result of our work is that among the types of instance-independent SBPs we studied and their combinations; the simplest and least complete constructions are the most effective. Our experiments also clearly indicate that instance-independent symmetries should mostly be processed together with instance-specific symmetries rather than at the specification level; contrary to what has been suggested in the literature. © 2006 AI Access Foundation. All rights reserved;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Journal article (JA)
引用
收藏
页码：289 / 322
相关论文
共 39 条
  • [21] A COLOR-EXCHANGE ALGORITHM FOR EXACT GRAPH-COLORING
    SAGER, TJ
    LIN, SJ
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 507 : 22 - 28
  • [22] An exact resource constrained-scheduler using graph coloring technique
    Cherroun, Hadda
    Feautrier, Paul
    2007 IEEE/ACS INTERNATIONAL CONFERENCE ON COMPUTER SYSTEMS AND APPLICATIONS, VOLS 1 AND 2, 2007, : 554 - +
  • [23] A linked list-based exact algorithm for graph coloring problem
    Shukla A.N.
    Bharti V.
    Garag M.L.
    Revue d'Intelligence Artificielle, 2019, 33 (03): : 189 - 195
  • [24] Breaking the search space symmetry in partitioning problems - An application to the graph coloring problem
    Talbi, El-Ghazali
    Weinberg, Benjamin
    THEORETICAL COMPUTER SCIENCE, 2007, 378 (01) : 78 - 86
  • [25] Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation
    Gualandi, Stefano
    Malucelli, Federico
    INFORMS JOURNAL ON COMPUTING, 2012, 24 (01) : 81 - 100
  • [26] Exact square coloring of graphs resulting from some graph operations and products
    Priyamvada
    Panda, B. S.
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2022, 19 (03) : 211 - 220
  • [27] Exact and Heuristic Graph-Coloring for Energy Efficient Advance Cloud Resource Reservation
    Ghribi, Chaima
    Zeghlache, Djamal
    2014 IEEE 7TH INTERNATIONAL CONFERENCE ON CLOUD COMPUTING (CLOUD), 2014, : 112 - 119
  • [28] An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs
    Seker, Oylum
    Ekim, Tinaz
    Taskin, Z. Caner
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 291 (01) : 67 - 83
  • [29] Automorphism Ensemble Decoding of Quasi-Cyclic LDPC Codes by Breaking Graph Symmetries
    Geiselhart, Marvin
    Ebada, Moustafa
    Elkelesh, Ahmed
    Clausius, Jannis
    ten Brink, Stephan
    IEEE COMMUNICATIONS LETTERS, 2022, 26 (08) : 1705 - 1709
  • [30] A Tree Based Novel Approach for Graph Coloring Problem Using Maximal Independent Set
    Prakash C. Sharma
    Narendra S. Chaudhari
    Wireless Personal Communications, 2020, 110 : 1143 - 1155
1234