IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4757-3023-4_1.html

The Maximum Clique Problem

In: Handbook of Combinatorial Optimization

Author

Listed:
  • Immanuel M. Bomze

    (Universität Wien, Institut für Statistik, Operations Research und Computerverfahren)

  • Marco Budinich

    (Università di Trieste, Dipartimento di Fisica)

  • Panos M. Pardalos

    (ISE Department University of Florida, Center for Applied Optimization)

  • Marcello Pelillo

    (Università Ca’ Foscari di Venezia, Dipartimento di Informatica)

Abstract

The maximum clique problem is a classical problem in combinatorial optimization which finds important applications in different domains. In this paper we try to give a survey of results concerning algorithms, complexity, and applications of this problem, and also provide an updated bibliography. Of course, we build upon precursory works with similar goals [39, 232, 266].

Suggested Citation

  • Immanuel M. Bomze & Marco Budinich & Panos M. Pardalos & Marcello Pelillo, 1999. "The Maximum Clique Problem," Springer Books, in: Ding-Zhu Du & Panos M. Pardalos (ed.), Handbook of Combinatorial Optimization, pages 1-74, Springer.
    • Handle: RePEc:spr:sprchp:978-1-4757-3023-4_1
    DOI: 10.1007/978-1-4757-3023-4_1
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-1-4757-3023-4_1. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.