Fingerprint
Dive into the research topics of 'Computing the k densest subgraphs of a graph'. Together they form a unique fingerprint.- Sort by
- Weight
- Alphabetically
Computing the k densest subgraphs of a graph
Riccardo Dondi, Danny Hermelin
Research output: Contribution to journal › Article › peer-review
1
Scopus
citations