The Maximum Clique Problem

Immanuel M. Bomze (), Marco Budinich (), Panos M. Pardalos () and Marcello Pelillo ()
Additional contact information
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

A chapter in Handbook of Combinatorial Optimization, 1999, pp 1-74 from Springer

Abstract: 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].

Keywords: Tabu Search; Random Graph; Vertex Cover; Maximum Clique; Chordal Graph (search for similar items in EconPapers)
Date: 1999
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4757-3023-4_1

Ordering information: This item can be ordered from
http://www.springer.com/9781475730234

DOI: 10.1007/978-1-4757-3023-4_1

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().