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

Murali Krishna P; Sabu . M Thampi

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.DM cs.CC

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

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

Multi-Capacity Online Assortment Optimization with Consecutive Stays under Markov Chain Choice

We study online assortment optimization under Markov chain choice and independent Bernoulli arrivals, with each period's request type known in advance. Each product may have multiple interchangeable physical copies, and each booking reserves consecutive service slots on a single copy. Customers choose among products, while the platform assigns purchases to feasible copies. We develop a sales-based relaxation that upper-bounds the optimal online revenue and use it to design a policy with two components: independent sampling and purchase--update coupling. We generate independent copy proposals and make a product eligible whenever at least one of its copies proposes. A general revenue-extraction bound for random candidate sets with independent product inclusions shows that optimizing over eligible products recovers at least half of each period's relaxation revenue benchmark in expectation. A purchase--update coupling reproduces the interval flows through independent virtual copy updates while preserving physical feasibility. Under general Markov chain choice, the policy uses a random gate to make the coupling feasible: it offers the selected assortment with probability $1-1/e$ and the empty assortment otherwise. No gate is needed under multinomial logit (MNL) choice. The resulting policies achieve approximation ratios of $(1-1/e)/2$ and $1/2$, respectively, relative to the optimal nonanticipative online policy, independently of product capacities. In the single-copy MNL setting, our policy improves the guarantee of \citet{huwu2026} from $0.271$ to $1/2$ under the same arrival convention. The $1/2$ static extraction factor and the $1-1/e$ uniform scalar-gate factor are separately sharp, and the $1/2$ MNL guarantee is tight for the proposed policy.

cs.DM↗

arXiv2026

Euclidean Embeddings of Acyclic Hypergraph Line Metrics

We study Euclidean embeddings of higher-order line metrics arising from hypergraphs. For a fixed threshold $s\geq 1$, the $s$-line graph $L_s(H)$ has one vertex for each hyperedge of $H$, with two hyperedges adjacent when they intersect in at least $s$ vertices; its shortest-path metric is the native $s$-line metric. In the unrestricted setting, every finite graph occurs as the $s$-line graph of some hypergraph, so the worst-case Euclidean distortion is $Θ(\log n)$. We show that $α$-acyclicity yields a sharp improvement to $Θ(\sqrt{\log\log n})$. Although the canonical join tree of an $α$-acyclic hypergraph may have arbitrarily large stretch relative to the native metric, we prove that for every $s$, the $s$-line graphs of $α$-acyclic hypergraphs are exactly the dually chordal graphs. Using their constant-factor spanning-tree approximations together with classical tree-embedding bounds, we obtain an $O(\sqrt{\log\log n})$ Euclidean embedding bound. We then show this is asymptotically tight by realizing every finite tree as the $s$-line graph of an $α$-acyclic hypergraph. Thus, the worst-case distortion is $Θ(\sqrt{\log\log n})$, including for hypergraphs of rank at most $3s+1$.

cs.DM↗

arXiv2026

Degree Stability of Parallel Greedy Matching in Random Graphs

We study a natural synchronous greedy matching process in Erdős-Rényi random graphs $\mathbb{G}(n,p)$ and give a rigorous analysis of this parallel stochastic dynamics. The process evolves as follows: in each round, every unmatched vertex proposes to a uniformly random neighbour, and mutually proposing pairs are matched and removed from the graph, after which the process repeats on the residual graph. We consider the density regime $p=Θ(\log^{1+ε} n/n)$ for any constant $ε>0$, which lies just above the threshold for the existence of a perfect matching. We show that, with high probability, for $Θ(\log^{1+ε} n)$ rounds, every unmatched vertex keeps a constant fraction of its initial degree in the residual graph, simultaneously for all vertices and all rounds. By then, the process has matched a constant fraction of the vertices. Our analysis tracks fine-grained invariants that control the evolution of individual vertex degrees, rather than directly tracking the global degree distribution. At the local level, we analyze the per-round degree loss of a vertex via a neighbourhood-exposure martingale. We show that structural sparsity of $\mathbb{G}(n,p)$ yields $O(1)$ variance and thus the per-round degree loss is strongly concentrated around its conditional expectation. At the global level, these local concentration bounds control the increments of a martingale tracking cumulative degree loss over many rounds, allowing us to show that vertex degrees remain stable for $Ω(\log^{1+ε} n)$ rounds.

cs.DM↗