"Solving maximum clique in sparse graphs: an O(nm+n2d/4 ..."

Austin Buchanan et al. (2014)

> Home

Details and statistics

DOI: 10.1007/S11590-013-0698-2

access: closed

type: Journal Article

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ol/BuchananWBP14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ol/BuchananWBP14
Austin Buchanan, Jose L. Walteros, Sergiy Butenko, Panos M. Pardalos:
Solving maximum clique in sparse graphs: an O(nm+n2^d/4 algorithm for d-degenerate graphs. Optim. Lett. 8(5): 1611-1617 (2014)

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.