"An Efficient Local Search for the Maximum Clique Problem on Massive Graphs."

Kazuho Kanahara et al. (2022)

> Home

Details and statistics

DOI: 10.1007/978-3-030-95903-6_22

access: closed

type: Conference or Workshop Paper

metadata version: 2023-04-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/eidwt/KanaharaOKUK22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/eidwt/KanaharaOKUK22
Kazuho Kanahara, Tetsuya Oda, Elis Kulla, Akira Uejima, Kengo Katayama:
An Efficient Local Search for the Maximum Clique Problem on Massive Graphs. EIDWT 2022: 201-211

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.