Finding Cliques of a Graph using Prime Numbers

Simple item page
dc.creatorKulkarni, Dhananjay D.
dc.creatorVerma, Shekhar
dc.creatorPrashant
dc.date2006-01-27
dc.date2007-01-18
dc.date.accessioned2026-07-07T07:41:26Z
dc.date.available2026-07-07T07:41:26Z
dc.descriptionThis 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.
dc.description7 pages, 1 figure
dc.identifierhttps://arxiv.org/abs/cs/0601117
dc.identifierhttp://arxiv.org/abs/cs/0601117
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/122104
dc.subjectData Structures and Algorithms
dc.titleFinding Cliques of a Graph using Prime Numbers
dc.typetext

Files

Collections

arXiv