Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

103

Voted

AAIM
2006
Springer

101views Algorithms» more AAIM 2006»

A New Approach for Solving the Maximum Clique Problem

15 years 8 months ago

A New Approach for Solving the Maximum Clique Problem

Download www.scs.carleton.ca

Peter J. Taillon

Real-time Traffic

AAIM 2006 | Algorithms |

claim paper

Related Content

» Using Constraint Programming to Solve the Maximum Clique Problem

» A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem

» A study of ACO capabilities for solving the maximum clique problem

» Solving the maximum edge weight clique problem via unconstrained quadratic programming

» A new trust region technique for the maximum weight clique problem

» Solving the Maximum Clique Problem Using PUBB

» A Complementary Pivoting Approach to the Maximum Weight Clique Problem

» Clique Relaxations in Social Network Analysis The Maximum kPlex Problem

» Dynamic Local Search for the Maximum Clique Problem

Post Info
More Details (n/a)

Added	13 Jun 2010
Updated	13 Jun 2010
Type	Conference
Year	2006
Where	AAIM
Authors	Peter J. Taillon

Comments (0)