Fast Winner-Takes-All Networks for the Maximum Clique Problem
نویسندگان
چکیده
منابع مشابه
Solving the winner determination problem via a weighted maximum clique heuristic
Combinatorial auctions (CAs) where bidders can bid on combinations of items is an important model in many application areas. CAs attract more and more attention in recent years due to its relevance to fast growing electronic business applications. In this paper, we study the winner determination problem (WDP) in CAs which is known to be NP-hard and thus computationally difficult in the general ...
متن کاملFast Algorithm for Finding Maximum Clique in Scale-Free Networks
The maximum clique problem in graph theory concerns finding the largest subset of vertices in which all vertices are connected with an edge. Computation of such subset is a well-known NP-hard problem and there exist many algorithms to solve it. For our purposes we created an algorithm specially targeted for solving this problem in scale-free networks, where many significant search improvements ...
متن کاملA Fast Winner-Take-All Neural Networks With the Dynamic Ratio
In this paper, we propose a fast winner-take-all (WTA) neural network. The fast winner-take-all neural network with the dynamic ratio in mutual-inhibition is developed from the general mean-based neural network (GEMNET), which adopts the mean of the active neurons as the threshold of mutual inhibition. Furthermore, the other winner-take-all neural network enhances the convergence speed to becom...
متن کاملFinding the maximum clique in massive graphs
1. ABSTRACT Cliques refer to subgraphs in an undirected graph such that vertices in each subgraph are pairwise adjacent. The maximum clique problem, to find the clique with most vertices in a given graph, has been extensively studied. Besides its theoretical value as an NPhard problem, the maximum clique problem is known to have direct applications in various fields, such as community search in...
متن کاملA Fast Heuristic Algorithm Based on Verification and Elimination Methods for Maximum Clique Problem
A clique in an undirected graph G= (V, E) is a subset V ' ⊆ V of vertices, each pair of which is connected by an edge in E. The clique problem is an optimization problem of finding a clique of maximum size in graph. The clique problem is NP-Complete. We have succeeded in developing a fast algorithm for maximum clique problem by employing the method of verification and elimination. For a graph o...
متن کامل