.png){kind=icon}
返回
A review on algorithms for maximum clique problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2014.09.064.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The maximum clique problem (MCP) is to determine in a graph a clique (i.e., a complete subgraph) of maximum cardinality. The MCP is notable for its capability of modeling other combinatorial problems and real-world applications. As one of the most studied NP-hard problems, many algorithms are available in the literature and new methods are continually being proposed. Given that the two existing surveys on the MCP date back to 1994 and 1999 respectively, one primary goal of this paper is to provide an updated and comprehensive review on both exact and heuristic MCP algorithms, with a special focus on recent developments. To be informative, we identify the general framework followed by these algorithms and pinpoint the key ingredients that make them successful. By classifying the main search strategies and putting forward the critical elements of the most relevant clique methods, this review intends to encourage future development of more powerful methods and motivate new applications of the clique approaches. (C) 2014 Elsevier B.V. All rights reserved.
Keyword:
Maximum clique problems
Exact algorithms
Heuristics
Applications
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
El apocalipsis es decepcionante: el punto muerto despolitizado del consenso sobre el cambio climático.png)
Punto sur
OAAI
Punto surIF0
OAAI分享收藏Irregular Subharmonic Cluster Patterns in an Autonomous Photoelectrochemical Oscillator自主光电化学振荡器中的不规则次谐波簇模式
PREAI
分享收藏Oxidation induced self-assembly transformation of dendron-b-oligoaniline-b-dendron dumbbell shape triblock oligomerSoft Matter
Soft MatterIF0
PREAI
分享收藏
查看更多内容