The maximum clique enumeration problem: algorithms, applications, and implementations
BMC Bioinformatics2012Vol. 13(S10), pp. S5–S5
Citations Over TimeTop 10% of 2012 papers
Abstract
Several algorithmic improvements to MCE are made which progressively decrease the run time on graphs in the testbed. Frequently the final runtime improvement is several orders of magnitude. As a result, instances which were once prohibitively time-consuming to solve are brought into the domain of realistic feasibility.
Related Papers
- → Circuit design for clique problem and its implementation on quantum computer(2021)7 cited
- → Benchmark Problems for Exhaustive Exact Maximum Clique Search Algorithms(2019)5 cited
- → The Clique Problem - A Polynomial Time and Non-Heuristic Solution(2018)2 cited
- → A Parallel Branch and Bound Algorithm for the Maximum Labelled Clique Problem(2014)