This newly expanded and updated second edition of the best-selling classic continues to
take the" mystery" out of designing algorithms, and analyzing their efficacy and efficiency …

XII Preface solution as efficiently as possible. Most of the problems we treat have a good
algorithmic solution, but we also show how even difficult problems can be treated (for …

It is well known that for many NP-complete problems, such as K-Sat, etc., typical cases are
easy to solve; so that computationally hard cases must be rare (assuming P= NP). This …

Graph colouring is one of those rare examples in the mathematical sciences of a problem
that, while easy to state and visualise, has many aspects that are exceptionally difficult to …

Problems such as bisection, graph coloring, and clique are generally believed hard in the
worst case. However, they can be solved if the input data is drawn randomly from a …

The paper describes a simple heuristic approach to solving large-scale constraint
satisfaction and scheduling problems. In this approach one starts with an inconsistent …

In a random graph on n vertices, the maximum clique is likely to be of size very close to 2 lg
n. However, the clique produced by applying the naive “greedy” heuristic to a random graph …

Firefly algorithms belong to modern meta-heuristic algorithms inspired by nature that can be
successfully applied to continuous optimization problems. In this paper, we have been …

The average-case complexity of recognising some NP-complete properties is examined,
when the instances are randomly selected from those which have the property. We carry out …

We study the expected time complexity of two graph partitioning problems: the graph
coloring and the cut into equal parts. If k= o (√ n log n), we can test whether two vertices of a …