A deterministic approximation algorithm for the Densest k-Subgraph Problem
Work
Year: 2008
Type: article
Abstract: In the Densest k-Subgraph Problem (DSP), we are given an undirected weighted graph G = (V, E) with n vertices (v1,..., vn). We seek to find a subset of k vertices (k belonging to {1,..., n}) which max... more
Authors Frédéric Roupin, Alain Billionnet
Institution Conservatoire National des Arts et Métiers
Cites: 21
Cited by: 19
Related to: 10
FWCI: 1.812
Citation percentile (by year/subfield): 72.8
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green