Contraction-Based Method For Computing A Lower Bound On The Clique Number Of A Graph

Assia Gueham, Hacène Aït Haddadène, Anass Nagih

2019 6TH INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT 2019)（2019）

引用 0|浏览4

暂无评分

摘要

This paper proposes a new method to determine the clique of maximum cardinality in a graph. More precisely, we propose a contraction-based approach, which uses the orientation algorithm and the labeling order scheme of vertices. This method allows to effeciently compute both upper and lower bounds of the clique number.The experimental results on instances of the library DIMACS are validated against our method.

查看译文

关键词

clique number,contraction-based method,maximum cardinality,contraction-based approach,orientation algorithm,upper bounds,lower bounds

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要