Algorithms for Maximum Clique and Independent Set Problems

Graph-theoretic problems of identifying maximum cliques and maximum independent sets occupy a central place in combinatorial optimisation and theoretical computer science. A clique is a set of mutually adjacent vertices, whereas an independent set comprises vertices with no mutual connections. Both problems are NP-hard, implying that no general polynomial-time solution is known and that exact algorithms are often feasible only on moderate-sized instances. Researchers pursue two principal algorithmic paradigms: exact methods, which guarantee optimality via systematic search or mathematical programming, and heuristic or metaheuristic schemes, which deliver high-quality solutions with practical scalability. Exact approaches typically deploy branch-and-bound frameworks, graph colouring bounds and Boolean satisfiability encodings to prune large portions of the search space. Heuristic strategies encompass local-search, evolutionary and learning-based techniques, often enhanced by restart mechanisms or adaptive parameter control. Beyond theoretical appeal, advances in these algorithms underpin applications in computational biology, social network analysis, telecommunications and chemistry, where cliques may represent functional modules, and independent sets can model resource allocation without conflict.

Research from Nature Portfolio

Recent studies have introduced a branch-and-bound algorithm tailored to the maximum weight clique problem in large weighted graphs. By integrating a novel weighted graph-colouring subroutine, this method computes tight upper bounds on clique weight, thereby accelerating the search on both random high-density graphs and standard benchmarks. A dynamically adaptive variant further refines bound estimates during execution, yielding speed improvements of several orders of magnitude over existing solvers. Benchmark results demonstrate effective scaling to graphs of ten thousand vertices, and practical gains in domains such as drug discovery suggest this algorithm may serve as a new standard for exact weighted-clique computation.

Algorithms for Maximum Clique and Independent Set Problems publication trend

The graph below shows the total number of articles in algorithms for maximum clique and independent set problems across all publications each year (not limited to Nature Index journals).

Technical terms

Clique: A subset of vertices in which every pair is connected by an edge.

Independent set: A subset of vertices with no edges between any two members.

NP-hard: A class of problems for which no polynomial-time algorithm is known, signifying high computational complexity.

Branch-and-bound: A systematic search method that partitions a problem into subproblems and uses bounding functions to prune suboptimal regions.

Heuristic algorithm: An approach that seeks good solutions efficiently without guaranteeing global optimality.

Graph neural network: A machine learning architecture that directly processes graph structures to learn representations of nodes and edges.

References

1. The max-out min-in problem: A tool for data analysis. Computers & Operations Research (2023).
2. An exact algorithm to find a maximum weight clique in a weighted undirected graph. Scientific Reports (2024).
3. Graph Neural Networks for Maximum Constraint Satisfaction. Frontiers in Artificial Intelligence (2021).
4. Exact Maximum Clique Algorithm for Different Graph Types Using Machine Learning. Mathematics (2021).