학술논문
Exact and superpolynomial approximation algorithms for the densest k-subgraph problem
Document Type
Article
Author
Source
In European Journal of Operational Research 1 November 2017 262(3):894-903
Subject
Language
ISSN
0377-2217