首页 /研究 /SMC-BRB: an algorithm for the maximum clique problem over large and sparse graphs with the upper bound via $$s^+$$-index
OTHER

SMC-BRB: an algorithm for the maximum clique problem over large and sparse graphs with the upper bound via $$s^+$$-index

Mingqiang Zhou, Qianqian Zeng, Ping Guo

发表年份
2022
引用次数
2

关键词

CliqueComputer scienceClique problemUpper and lower boundsIndex (typography)AlgorithmTheoretical computer scienceCombinatoricsGraphChordal graph

相关论文

查看 OTHER 分类全部论文