"Finding a Maximum Clique in an Arbitrary Graph."

Egon Balas, Chang Sung Yu (1986)

> Home

Details and statistics

DOI: 10.1137/0215075

access: closed

type: Journal Article

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/BalasY86
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/BalasY86
Egon Balas, Chang Sung Yu:
Finding a Maximum Clique in an Arbitrary Graph. SIAM J. Comput. 15(4): 1054-1068 (1986)

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.