Max-Density Revisited: a Generalization and a More Efficient Algorithm

Max-Density Revisited: a Generalization and a More Efficient Algorithm

We present an algorithm that given a graph computes a subgraph of maximum 'density'. (For unweighed graphs, density is the edges-to-vertices ratio). The proposed algorithm is asymptotically more efficient than the currently available ones. Our approach remains efficient for weighed graphs...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computer journal 2007-05, Vol.50 (3), p.348
Hauptverfasser: Georgakopoulos, George F, Politopoulos, Kostas
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Approximation
Computer programming
Graphs
Linear programming
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We present an algorithm that given a graph computes a subgraph of maximum 'density'. (For unweighed graphs, density is the edges-to-vertices ratio). The proposed algorithm is asymptotically more efficient than the currently available ones. Our approach remains efficient for weighed graphs and more generally for weighed set-systems. Two faster approximation algorithms are offered, and a number of applications are discussed. [PUBLICATION ABSTRACT]
ISSN:0010-4620
1460-2067
DOI:10.1093/comjnl/bxl082