Finding Cliques of a Graph using Prime Numbers

2006/01/27 by Dhananjay D. Kulkarni, Shekhar Verma, Kulkarni, Dhananjay D. +3
Computer Science · Social Sciences · #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Mathematics Education and Teaching Techniques #cs.DS

paper · pdf · doi:10.48550/arxiv.cs/0601117

7 pages, 1 figure

openalex publication_date 2006/01/27 · arxiv created 2007/01/18 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This paper proposes a new algorithm for solving maximal cliques for simple undirected graphs using the theory of prime numbers. A novel approach using prime numbers is used to find cliques and ends with a discussion of the algorithm.

Related

• Algorithm 457: finding all cliques of an undirected graph
• A Polynomial Time Algorithm For Solving Clique Problems
• A Novel Approach Applied to the Largest Clique Problem
• Is it possible to find the maximum clique in general graphs?
• An upper bound for the clique number using clique ceiling numbers