Why Is Maximum Clique Often Easy in Practice?

• 成果类型: Article
• 署名作者: Walteros, Jose L.; Buchanan, Austin
• 署名单位: State University of New York (SUNY) System; University at Buffalo, SUNY; Oklahoma State University System; Oklahoma State University - Stillwater
• 刊物名称: OPERATIONS RESEARCH
• ISSN/ISSBN: 0030-364X
• DOI: 10.1287/opre.2019.1970
• 发表日期: 2020
• 页码: 1866-1895
• 关键词: bound algorithm; vertex cover; graphs

摘要

To this day, the maximum clique problem remains a computationally challenging problem. Indeed, despite researchers' best efforts, there exist unsolved benchmark instances with 1,000 vertices. However, relatively simple algorithms solve real-life instances with millions of vertices in a few seconds. Why is this the case? Why is the problem apparently so easy in many naturally occurring networks? In this paper, we provide an explanation. First, we observe that the graph's clique number. is very near to the graph's degeneracy d in most real-life instances. This observation motivates a main contribution of this paper, which is an algorithm for the maximum clique problem that runs in time polynomial in the size of the graph, but exponential in the gap g := (d + 1) - omega between the clique number omega and its degeneracy-based upper bound d+1. When this gap g can be treated as a constant, as is often the case for real-life graphs, the proposed algorithm runs in time O(dm) = O(m(1.5)). This provides a rigorous explanation for the apparent easiness of these instances despite the intractability of the problem in the worst case. Further, our implementation of the proposed algorithm is actually practical-competitive with the best approaches from the literature.