"An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique."

Etsuji Tomita, Tomokazu Seki (2003)

> Home

Details and statistics

DOI: 10.1007/3-540-45066-1_22

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/dmtcs/TomitaS03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dmtcs/TomitaS03
Etsuji Tomita, Tomokazu Seki:
An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique. DMTCS 2003: 278-289

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.