"Maximal k-Clique Scheduling: A simple algorithm to bound maximal ..."

Kanes Sutuntivorakoon et al. (2011)

> Home

Details and statistics

DOI: 10.1109/ALLERTON.2011.6120251

access: closed

type: Conference or Workshop Paper

metadata version: 2020-12-29

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/allerton/SutuntivorakoonAAS11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/allerton/SutuntivorakoonAAS11
Kanes Sutuntivorakoon, Vaneet Aggarwal, Amir Salman Avestimehr, Ashutosh Sabharwal:
Maximal k-Clique Scheduling: A simple algorithm to bound maximal independent graph scheduling. Allerton 2011: 816-823

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.