"An Ant Colony Optimisation Approach to the Densest k-Subgraph Problem."

Zoltán Tasnádi, Noémi Gaskó (2022)

> Home

Details and statistics

DOI: 10.1109/SYNASC57785.2022.00039

access: closed

type: Conference or Workshop Paper

metadata version: 2023-06-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/synasc/TasnadiG22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/synasc/TasnadiG22
Zoltán Tasnádi, Noémi Gaskó:
An Ant Colony Optimisation Approach to the Densest k-Subgraph Problem. SYNASC 2022: 208-211

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.