Skip Navigation


The Computer Journal Advance Access originally published online on January 31, 2007
The Computer Journal 2007 50(3):348-356; doi:10.1093/comjnl/bxl082
This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
50/3/348    most recent
bxl082v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Georgakopoulos, G. F.
Right arrow Articles by Politopoulos, K.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2007. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

MAX-DENSITY Revisited: a Generalization and a More Efficient Algorithm

George F. Georgakopoulos1,* and Kostas Politopoulos2

1 Computer Science Department, University of Crete, Knossou Avenue, Heraklion, Greece
2 Department of Electrical and Computer Engineering, National Technical University of Athens, Greece

* Corresponding author: ggeo{at}csd.uoc.gr

Received 14 December 2005; revised 22 November 2006

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.

Key Words: Graphs • maximum density subgraphs • primal–dual technique


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.