Cite
HARVARD Citation
Sotirov, R. (2020). On solving the densest k-subgraph problem on large graphs. Optimization methods and software. pp. 1160-1178. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Sotirov, R. (2020). On solving the densest k-subgraph problem on large graphs. Optimization methods and software. pp. 1160-1178. [Online].