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
Scale Reduction Techniques for Computing Maximum Induced Bicliques
TL;DR: In this article, the authors consider two associated optimization problems, the maximum biclique problem, which asks for a biclique of the maximum cardinality in the graph, and the maximum edge biclice problem, aiming to find a vertex with the maximum number of edges in the network.
Journal ArticleDOI
Minimizing Test Suites with Unfoldings of Multithreaded Programs
TL;DR: This article shows how this unfolding can be used to generate minimal test suites covering all local states of the program and proposes an SMT encoding and two methods based on heuristics which only approximate the solution, but scale better in practice.
Posted Content
Throughput Maximization in Cloud-Radio Access Networks using Rate-Aware Network Coding
TL;DR: This paper proposes mixing the flows of multiple users using instantly decodable network coding (IDNC) and shows that the method achieves substantial performance gains for all system configurations which collaborates the theoretical findings.
Journal ArticleDOI
Dynamic thresholding search for minimum vertex cover in massive sparse graphs
TL;DR: Computer experiments indicate that DTS_MVC performs remarkably well by discovering 7 improved best known results (new upper bounds) and a novel non-parametric operation-prohibiting mechanism is introduced to avoid search cycling.
Journal ArticleDOI
Linear-time robot localization and pose tracking using matching signatures
TL;DR: A feature-based method for global localization of mobile robot using a concept of matching signatures, where a group of geometric features, their geometric constraints invariant to frame transform, and location dependent constraints, together are utilized in defining signature of a feature.
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.