Skip to Main Content
Log In or Out
Skip to Search

springer.com springerprotocols.com Choose preferred language

SpringerLink

You have Guest access.

What can I do as a guest?

Search

Basic Search Search For All Content

Author or Editor Publication Volume Issue Page

Advanced Search

Content

Search For

Full Text Title & Abstract Title Only

DOI

Author

Editor

Citation

Publication (Title, DOI, ISSN, ISBN)

Volume

Issue

Page

Category and Date Limiters

Content Category

Entire Range of Publication Dates

Select date range Publication Dates Between Start DateANDEnd Date

Order of Results Most Relevant First Most Recently Published First Alphabetical

Share this item
- email
- citeulike
- Connotea
- Delicious
citeulike

Mathematics and Statistics

Encyclopedia of Optimization

2001, 951-963, DOI: 10.1007/0-306-48332-7_195

Graph coloring; Greedy randomized adaptive search procedures; Heuristics for maximum clique and independent set; Replicator dynamics in combinatorial optimization HEURISTICS FOR MAXIMUM CLIQUE AND INDEPENDENT SET

Marcello Pelillo

Related
Book

View Related Documents

Reference Work Entry
Heuristics for Maximum Clique and Independent Set
Marcello Pelillo
2009, Encyclopedia of Optimization, Part 8, Pages 1508-1520
- View HTML
Reference Work Entry
Replicator Dynamics in Combinatorial Optimization
Marcello Pelillo
2001, Encyclopedia of Optimization, Pages 2197-2209
- View HTML
Reference Work Entry
Replicator Dynamics in Combinatorial Optimization
Marcello Pelillo
2009, Encyclopedia of Optimization, Part 18, Pages 3279-3291
- View HTML
Journal Article
The maximum clique problem
Panos M. Pardalos and Jue Xue
Journal of Global Optimization, 1994, Volume 4, Number 3, Pages 301-328
- Download PDF (1.7 MB)
Book Chapter
A Continuous Characterization of Maximal Cliques in k-Uniform Hypergraphs
Samuel Rota Bulò and Marcello Pelillo
Lecture Notes in Computer Science, 2008, Volume 5313, Learning and Intelligent Optimization, Pages 220-233
- Download PDF (833.5 KB)
Book Chapter
Matching hierarchical structures using association graphs
Marcello Pelillo, Kaleem Siddiqi and Steven W. Zucker
Lecture Notes in Computer Science, 1998, Volume 1407, Computer Vision — ECCV’98, Pages 3-16
- Download PDF (875.8 KB)
Journal Article
Some Spin Glass Ideas Applied to the Clique Problem
Antonio Iovanella, Benedetto Scoppola and Elisabetta Scoppola
Journal of Statistical Physics, 2007, Volume 126, Numbers 4-5, Pages 895-915
- Download PDF (303.4 KB)
Journal Article
An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational Experiments
Etsuji Tomita and Toshikatsu Kameda
Journal of Global Optimization, 2007, Volume 37, Number 1, Pages 95-111
- Download PDF (227.3 KB)
Book Chapter
A Stochastic Local Search Approach to Vertex Cover
Silvia Richter, Malte Helmert and Charles Gretton
Lecture Notes in Computer Science, 2007, Volume 4667, KI 2007: Advances in Artificial Intelligence, Pages 412-426
- Download PDF (436.1 KB)
Book Chapter
A Continuous-Based Approach for Partial Clique Enumeration
Samuel Rota Bulò, Andrea Torsello and Marcello Pelillo
Lecture Notes in Computer Science, 2007, Volume 4538, Graph-Based Representations in Pattern Recognition, Pages 61-70
- Download PDF (397.9 KB)

Advertisment

Abstract

90C59 - 05C69 - 05C85 - 68W01

heuristics - algorithms - clique - independent set

Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us

© Springer, Part of Springer Science+Business Media Privacy, Disclaimer, Terms & Conditions, and Copyright Info