Finding Cliques of a Graph using Prime Numbers
<|reference_start|>Finding Cliques of a Graph using Prime Numbers: 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.<|reference_end|>
@article{kulkarni2006finding,
    title={Finding Cliques of a Graph using Prime Numbers},
    author={Dhananjay D. Kulkarni, Shekhar Verma, Prashant},
    journal={arXiv preprint arXiv:cs/0601117},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0601117},
    primaryClass={cs.DS}
}