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
Energy-Efficient Resource Allocation for Federated Learning in NOMA-Enabled and Relay-Assisted Internet of Things Networks
TL;DR: In this article , a resource allocation scheme to reduce the overall energy consumption of FL in the relay-assisted IoT networks is proposed. But, due to the limited battery life of the edge devices, improving the energy-efficiency is a prime concern for FL.
Dissertation
Predicting Drug Target Proteins and Their Properties
TL;DR: In this work, a new heuristic, Leaf, for the approximation of a maximum independent set was developed, and evaluated in terms of its ability to remove redundancy from protein datasets, the goal being to generate the largest possible non-redundant dataset.
Proceedings ArticleDOI
Maximum clique based RGB-D visual odometry
TL;DR: This paper proposes a new feature-point based RGB-D visual odometry approach for estimating the relative camera motion from two consecutive frames, and designs a threshold technique to control the size of maximum clique.
Proceedings ArticleDOI
Finding a Summary for All Maximal Cliques
TL;DR: In this article, the authors propose to restrict the bound calculation operation to a particular subset of all search branches and make the best use of the bounds that have been previously calculated to speed up the process of finding a maximal clique summary.
Computing a maximal clique using bayesian belief networks
TL;DR: Thesiscomparing a MAXIMAL CLIQUE using bayesian belief systems and computer programming for solving the challenge of Bayesian identity crisis.
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.