A Novel Approach Applied to the Largest Clique Problem
نویسندگان
چکیده
A novel approach to complex problems has been previously applied to graph classification and the graph equivalence problem. Here we apply it to the NP complete problem of finding the largest perfect clique within a graph G. PACS numbers: 89.75.Hc, 89.90.+n, 46.70.-p, 95.75.Pq [email protected] [email protected] [email protected] 2
منابع مشابه
A game-theoretic approach to partial clique enumeration
In many computer vision and pattern recognition applications using graph-based representations, it is of great interest to be able to extract the k largest cliques in a graph. However, most methods are geared either towards extracting a single clique of maximum size, or enumerating all cliques, without following any particular order. In this paper, we present a novel approach for partial clique...
متن کاملA Continuous-Based Approach for Partial Clique Enumeration
In many applications of computer vision and pattern recognition which use graph-based knowledge representation, it is of great interest to be able to extract the K largest cliques in a graph, but most methods are geared either towards extracting the single clique of maximum size, or enumerating all cliques, without following any particular order. In this paper we present a novel approach for pa...
متن کاملA new approach to the planted clique problem
It is well known that finding the largest clique in a graph is NP-hard, [8]. Indeed, Hastad [5] has shown that it is NP-hard to approximate the size of the largest clique in an n vertex graph to within a factor n1−ǫ for any ǫ > 0. Not surprisingly, this has directed some researchers attention to finding the largest clique in a random graph. Let Gn,1/2 be the random graph with vertex set [n] in ...
متن کاملModified Approach for Solving Maximum Clique Problem
1.1 Maximum Clique Problem Assume that the finite undirected simple graph is given, where V is the set of nodes, E is the set of edges. The arbitrary full graph is called a clique. The clique, which does not contain other cliques, is called a maximal Clique. The largest maximal clique is called a maximum clique. To extract all maximal cliques from the graph G. Many algorithms have...
متن کاملA Novel Optimization Approach Applied to Multi-Pass Turning Process
Optimization of turning process is a non-linear optimization with constrains and it is difficult for the conventional optimization algorithms to solve this problem. The purpose of present study is to demonstrate the potential of Imperialist Competitive Algorithm (ICA) for optimization of multipass turning process. This algorithm is inspired by competition mechanism among imperialists and coloni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره cond-mat/0209419 شماره
صفحات -
تاریخ انتشار 2002