"On maximum degree-based γ-quasi-clique problem: Complexity and exact ..."

Grigory Pastukhov et al. (2018)

> Home

Details and statistics

DOI: 10.1002/NET.21791

access: closed

type: Journal Article

metadata version: 2020-03-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/PastukhovVBP18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/PastukhovVBP18
Grigory Pastukhov, Alexander Veremyev, Vladimir Boginski, Oleg A. Prokopyev:
On maximum degree-based γ-quasi-clique problem: Complexity and exact approaches. Networks 71(2): 136-152 (2018)

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.