Finding large and small dense subgraphs

Simple item page
dc.creatorAndersen, Reid
dc.date2007-02-05
dc.date.accessioned2026-07-07T07:44:41Z
dc.date.available2026-07-07T07:44:41Z
dc.descriptionWe consider two optimization problems related to finding dense subgraphs. The densest at-least-k-subgraph problem (DalkS) is to find an induced subgraph of highest average degree among all subgraphs with at least k vertices, and the densest at-most-k-subgraph problem (DamkS) is defined similarly. These problems are related to the well-known densest k-subgraph problem (DkS), which is to find the densest subgraph on exactly k vertices. We show that DalkS can be approximated efficiently, while DamkS is nearly as hard to approximate as the densest k-subgraph problem.
dc.description12 pages, no figures
dc.identifierhttps://arxiv.org/abs/cs/0702032
dc.identifierhttp://arxiv.org/abs/cs/0702032
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/123284
dc.subjectData Structures and Algorithms
dc.subjectF.2.2; G.2.2
dc.titleFinding large and small dense subgraphs
dc.typetext

Files

Collections

arXiv