"A parallel maximum clique algorithm for large and massive sparse graphs."

Pablo San Segundo et al. (2017)

> Home

Details and statistics

DOI: 10.1007/S11590-016-1019-3

access: closed

type: Journal Article

metadata version: 2021-04-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ol/SegundoLAP17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ol/SegundoLAP17
Pablo San Segundo, Alvaro Lopez, Jorge Artieda, Panos M. Pardalos:
A parallel maximum clique algorithm for large and massive sparse graphs. Optim. Lett. 11(2): 343-358 (2017)

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.