Skip to main content
SpringerLink
Log in

The Dense k -Subgraph Problem

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract.

This paper considers the problem of computing the dense k -vertex subgraph of a given graph, namely, the subgraph with the most edges. An approximation algorithm is developed for the problem, with approximation ratio O(n δ ) , for some δ < 1/3 .

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Applied Mathematics and Computer Science, The Weizmann Institute, Rehovot 76100, Israel., IL

    U. Feige & D. Peleg

  2. Department of Computer Science, The Open University, Tel Aviv, Israel., IL

    G. Kortsarz

Authors
  1. U. Feige
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. Peleg
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. G. Kortsarz
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received April 29, 1997; revised June 26, 1998, and April 13, 1999.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Feige, U., Peleg, D. & Kortsarz, G. The Dense k -Subgraph Problem . Algorithmica 29, 410–421 (2001). https://doi.org/10.1007/s004530010050

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s004530010050

Search

Navigation