Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 0710.0748

A Fast Heuristic Algorithm Based on Verification and Elimination Methods for Maximum Clique Problem

Murali Krishna P·Sabu . M Thampi
View original source ↗Read source document ↗Export metadata ↓

Abstract

A clique in an undirected graph G= (V, E) is a subset V' V of vertices, each pair of which is connected by an edge in E. The clique problem is an optimization problem of finding a clique of maximum size in graph. The clique problem is NP-Complete. We have succeeded in developing a fast algorithm for maximum clique problem by employing the method of verification and elimination. For a graph of size N there are 2N sub graphs, which may be cliques and hence verifying all of them, will take a long time. Idea is to eliminate a major number of sub graphs, which cannot be cliques and verifying only the remaining sub graphs. This heuristic algorithm runs in polynomial time and executes successfully for several examples when applied to random graphs and DIMACS benchmark graphs.

Explore related subjects

cs.DMcs.CC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Murali Krishna P, Sabu . M Thampi. 2007-10-03. A Fast Heuristic Algorithm Based on Verification and Elimination Methods for Maximum Clique Problem. https://arxiv.org/abs/0710.0748

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Differentiable Repairability & Mutations for Scalable Combinatorial Optimization

Combinatorial optimization problems such as Maximum Independent Set (MIS) and Maximum Cut (MaxCut) arise across a wide range of applications, yet solving large-scale instances remains computationally challenging. While discrete local-search procedures can produce high-quality solutions, their inherently sequential and iterative nature can become increasingly expensive as problem size and density grow. In this paper, we present a differentiable perspective on combinatorial optimization that leverages continuous relaxation with parallelizable gradient-based updates to improve scalability while reducing dependence on discrete local search. More specifically, for MIS, we show that solutions that remain repairable through a discrete (1,2)-swap can nevertheless be fixed points of projected gradient ascent, revealing a fundamental limitation of purely local gradient dynamics. For MaxCut, we develop a new quadratic formulation whose landscape provably allows projected gradient ascent to escape 1-flip-repairable solutions while ensuring binary local maximizers. Building on these insights, and inspired by discrete perturb-and-improve methods, we introduce a framework that combines projected gradient ascent with differentiable mutations (partial resets) to efficiently explore new regions of the solution space}. Experimental results on MIS and MaxCut demonstrate the potential of this approach for scalable combinatorial optimization, particularly in regimes where conventional discrete local search becomes computationally prohibitive.

cs.DM↗
arXiv2026

A simple algorithm for computing Hamilton paths on independent set polytopes

The independent set polytope, or stable set polytope, of a graph $G$ is the 0/1-polytope defined by the convex hull of the characteristic vectors of all independent sets of $G$. We present a simple algorithm for computing a Hamilton path on the independent set polytope of a given $n$-vertex graph $G$ with amortized delay $\mathcal{O}(n)$. The independent sets are listed such that two consecutive sets differ either in removing a vertex, or adding a vertex and removing its neighbors from the independent set, i.e., the symmetric difference between two consecutive independent sets induces a star in $G$. As applications of this result, we obtain an algorithm to compute a Hamilton path on the matching polytope of an $m$-edge graph $G$ with worst-case delay $\mathcal{O}(m)$, which lists all matchings of $G$ in such a way that the symmetric difference between two consecutive matchings is a path on at most three edges. Furthermore, we obtain an algorithm to compute a Hamilton path on the chain polytope and order polytope of an $n$-element poset $P$ with amortized delay $\mathcal{O}(n)$, which lists all antichains of $P$ or all ideals of $P$, respectively, by star exchanges. Our algorithms are derived from the generic framework proposed by Merino and Mütze (FOCS'23+SICOMP'24) for computing Hamilton paths on arbitrary 0/1-polytopes, which uses a linear optimization procedure as a black box. Our algorithms bypass solving the computationally intractable maximum weight independent set problem by a simple and purely combinatorial greedy rule.

cs.DM↗
arXiv2026

Detection and Construction of Small Blocking Sets via Critical Independent Sets and Matching Decomposition

The small blocking set detection and construction problem asks whether a given connected simple graph contains a nonempty independent set whose cardinality equals the size of its neighborhood and is strictly less than half the number of vertices, and, if so, how to construct such a set. Previous work characterized restless explorability in vertex-permuted temporal graphs using small blocking sets, but left the computational complexity of detecting their existence as an open problem. We give a polynomial-time algorithm for detection and construction. Specifically, we first compute a maximum-cardinality critical independent set and use its difference and cardinality to handle the cases that admit an immediate solution. In the remaining boundary case, where the critical difference is zero and the selected independent set contains exactly half the vertices, we establish a projection theorem using a perfect matching and neighborhood counting: the graph contains a small blocking set if and only if the selected independent set contains a nonempty proper tight subset. We then use matching contraction to translate the tight-subset condition into the absence of arcs leaving a vertex subset in an auxiliary digraph. This yields a strong-connectivity test for the existence of a small blocking set and, when one exists, a construction based on a sink strongly connected component. The result resolves the open complexity question for small blocking set detection and provides an explicit construction algorithm.

cs.DM↗