"Solving the maximum clique problem by k-opt local search."

Kengo Katayama, Akihiro Hamamoto, Hiroyuki Narihisa (2004)

> Home

Details and statistics

DOI: 10.1145/967900.968107

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/sac/KatayamaHN04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sac/KatayamaHN04
Kengo Katayama, Akihiro Hamamoto, Hiroyuki Narihisa:
Solving the maximum clique problem by k-opt local search. SAC 2004: 1021-1025

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.