"A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique."

Etsuji Tomita et al. (2010)

> Home

Details and statistics

DOI: 10.1007/978-3-642-11440-3_18

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/walcom/TomitaSHTW10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/walcom/TomitaSHTW10
Etsuji Tomita, Yoichi Sutani, Takanori Higashi, Shinya Takahashi, Mitsuo Wakatsuki:
A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique. WALCOM 2010: 191-203

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.