"An O(m + n log n) Algorithm for the Maximum-Clique Problem in Circular-Arc ..."

Binay K. Bhattacharya, Damon Kaller (1997)

> Home

Details and statistics

DOI: 10.1006/JAGM.1997.0868

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jal/BhattacharyaK97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/BhattacharyaK97
Binay K. Bhattacharya, Damon Kaller:
An O(m + n log n) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs. J. Algorithms 25(2): 336-358 (1997)

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.