By Topic

Using symbolic techniques to find the maximum clique in very large sparse graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Corno, F. ; Dipartimento di Autom. e Inf., Politecnico di Torino, Italy ; Prinetto, P. ; Sonza Reorda, M.

Several problems arising in CAD for VLSI, especially in logic and high level synthesis, are modeled as graph-theoretical problems. In particular minimization problems often require the knowledge of the cliques in a graph. This paper presents a new approach for finding the maximum clique in realistic graphs. The algorithm is built around a classical branch-and-bound, but exploits the efficiency of Binary Decision Diagrams and Symbolic Techniques to avoid explicit enumeration of the search space. The approach is proven to be more efficient than classical algorithms, which suffer from the enumeration problem, as well as purely symbolic implementations, which suffer from the explosion in the size of BDDs. As a result, we are able to compute the maximum clique without introducing approximations for graphs with billions of vertices and transitions

Published in:

European Design and Test Conference, 1995. ED&TC 1995, Proceedings.

Date of Conference:

6-9 Mar 1995