Crossmark

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

Published Online: 2022-12-12

Published Print: 2023-05

Authors

Zhou, Mingqiang https://orcid.org/0000-0003-3217-9503
Zeng, Qianqian

Guo, Ping
Funding

Funding for this research was provided by:

Natural Science Foundation of Chongqing (61702060)
License Information

Text and Data Mining valid from 2022-12-12

Version of Record valid from 2022-12-12
More Information

Article History

Accepted: 26 November 2022

First Online: 12 December 2022

Declarations

:

: All authors declare no relevant relationships.

Document is current