A fast algorithm for the maximum clique problem
Reads0
Chats0
TLDR
A branch-and-bound algorithm for the maximum clique problem--which is computationally equivalent to the maximum independent (stable) set problem--is presented with the vertex order taken from a coloring of the vertices and with a new pruning strategy.About:
This article is published in Discrete Applied Mathematics.The article was published on 2002-08-15 and is currently open access. It has received 645 citations till now. The article focuses on the topics: Independent set & Chordal graph.read more
Citations
More filters
Journal ArticleDOI
Delay Reduction in Multi-Hop Device-to-Device Communication Using Network Coding
TL;DR: This paper solves the problem of reducing the broadcast decoding delay of wireless networks using instantly decodable network coding- based device-to-device communications by reforming it as a maximum weight clique problem which can efficiently be solved.
Journal ArticleDOI
Permutation codes with specified packing radius
TL;DR: The packing radius more accurately specifies the requirement for an e-error-correcting permutation code than does the minimum Hamming distance, and the number of codewords in the best [n, e].
Proceedings ArticleDOI
A branch and bound approach to permutation codes
TL;DR: A new branch and bound algorithm is presented, which combines combinatorial techniques with an approach based on group orbits for code generation in the Maximum Permutation Code Problem.
Journal ArticleDOI
A robust and cooperative parallel tabu search algorithm for the maximum vertex weight clique problem
TL;DR: A robust and cooperative parallel tabu search algorithm (PTC) for the maximum vertex weight clique problem, which is a challenging NP-Hard combinatorial optimization problem that searches for a clique with maximum total sum of vertices’ weights.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Book ChapterDOI
The maximum clique problem
TL;DR: A survey of results concerning algorithms, complexity, and applications of the maximum clique problem is presented and enumerative and exact algorithms, heuristics, and a variety of other proposed methods are discussed.
Journal ArticleDOI
An exact algorithm for the maximum clique problem
TL;DR: In this paper, a partially enumerative algorithm for the maximum clique problem is presented, which is very simple to implement on an IBM 3090 computer and can be used to generate graphs with up to 3000 vertices and over one million edges.