"An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum ..."

Chu Min Li, Zhe Quan (2010)

> Home

Details and statistics

DOI: 10.1609/AAAI.V24I1.7536

access: open

type: Conference or Workshop Paper

metadata version: 2024-10-21

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/aaai/LiQ10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aaai/LiQ10
Chu Min Li, Zhe Quan:
An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem. AAAI 2010: 128-133

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.