Home /Research /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

Year
2022
Citations
2

Keywords

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

Related papers

Browse all OTHER papers