A local dense decision-making method for solving the maximum clique problem in large-scale undirected graphs
Computers and Electrical Engineering(2022)
Abstract
•A good initial search sequence.•Construct a new subplot to perform a contrastive search in the local legend.•Iterative method to find the optimal solution.•Multiple global pruning methods speed up the global optimal solution.
MoreTranslated text
Key words
The maximum clique,Decision function,Combination optimization,Locally dense,Branch and Bound
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined