"Computing the k densest subgraphs of a graph."

Riccardo Dondi, Danny Hermelin (2023)

Details and statistics

DOI: 10.1016/J.IPL.2022.106316

access: closed

type: Journal Article

metadata version: 2022-11-04

a service of  Schloss Dagstuhl - Leibniz Center for Informatics