default search action

combined dblp search
author search
venue search
publication search

ask others

"An approximation lagrangian-based algorithm for the maximum clique problem ..."

Jinyu Dai et al. (2022)

> Home

Details and statistics

DOI: 10.1016/J.JFRANKLIN.2022.06.009

access: closed

type: Journal Article

metadata version: 2023-08-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jfi/DaiWKJL22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jfi/DaiWKJL22
Jinyu Dai, Zhengtian Wu, Hamid Reza Karimi, Baoping Jiang, Guangquan Lu:
An approximation lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network. J. Frankl. Inst. 359(12): 6080-6098 (2022)

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.