Finding Cliques of a Graph using Prime Numbers

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
7 pages, 1 figure

Keywords

Data Structures and Algorithms

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/122104

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0601117
 http://arxiv.org/abs/cs/0601117

Collections

arXiv