相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。Reducing hypergraph coloring to clique search
Sandor Szabo et al.
DISCRETE APPLIED MATHEMATICS (2019)
Decomposing clique search problems into smaller instances based on node and edge colorings
Sandor Szabo et al.
DISCRETE APPLIED MATHEMATICS (2018)
On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
Chu-Min Li et al.
COMPUTERS & OPERATIONS RESEARCH (2017)
Branch-and-reduce exponential/FPT algorithms in practice: A case study of vertex cover
Takuya Akiba et al.
THEORETICAL COMPUTER SCIENCE (2016)
Infra-chromatic bound for exact maximum clique search
Pablo San Segundo et al.
COMPUTERS & OPERATIONS RESEARCH (2015)
A review on algorithms for maximum clique problems
Qinghua Wu et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2015)
Solving Open Job-Shop Scheduling Problems by SAT Encoding
Miyuki Koshimura et al.
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS (2010)
A fast algorithm for the maximum clique problem
PRJ Östergård
DISCRETE APPLIED MATHEMATICS (2002)
分享论文
