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
Solving robust bin-packing problems with a branch-and-price approach
TL;DR: In this paper , a branch-and-price algorithm is proposed to solve the robust bin-packing problem with uncertain sizes. But it does not take into account possible variations of item sizes around their nominal values.
Proceedings Article
A new art gallery algorithm for sensor location
Andrea Bottino,Aldo Laurentini +1 more
TL;DR: This work proposes a new sensors location incremental technique, which locally refines a starting approximation provided by an integer covering algorithm, where each edge is observed entirely by at least one sensor.
Journal ArticleDOI
The Coauthorship Network Analysis of the Norwegian School of Economics
Ivan Belik,Kurt Jörnsten +1 more
TL;DR: In this article, a coauthorship network based on the scientific collaboration between the faculty members at the Norwegian School of Economics (NHH) and based on their international academic publication experience is constructed.
Throughput optimization of urban wireless mesh networks
Stephan Bohacek,Peng Wang +1 more
TL;DR: This research presents techniques that are typically able to efficiently compute optimal schedules as well as optimal routing, and shows that optimal scheduling increases the throughput by a factor between three and ten over 802.11 CSMA/CA, depending on the density of the mesh routers and gateways.
Journal ArticleDOI
Using MinMax-Memory Claims to Improve In-Memory Workflow Computations in the Cloud
TL;DR: The procedure of how to find the MMCs for those workflows with arbitrary graphs in general and develop optimal efficient algorithms for some well-structured workflows in particular are presented and the values of this concept are shown.
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.