"SMC-BRB: an algorithm for the maximum clique problem over large and sparse ..."

Mingqiang Zhou, Qianqian Zeng, Ping Guo (2023)

> Home

Details and statistics

DOI: 10.1007/S11227-022-04982-7

access: closed

type: Journal Article

metadata version: 2023-04-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tjs/ZhouZG23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tjs/ZhouZG23
Mingqiang Zhou, Qianqian Zeng, Ping Guo:
SMC-BRB: an algorithm for the maximum clique problem over large and sparse graphs with the upper bound via s⁺-index. J. Supercomput. 79(7): 8026-8047 (2023)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.