software . 2015

A Java Software Library To Solve Clique Problems In Polynomial Time

Laplante, Michael;
  • Published: 01 Jan 2015
  • Publisher: figshare
Abstract
A polynomial time algorithm to finding the maximum clique, list of all maximal cliques and determining if a clique of size k exists for a given graph. This polynomial time solution proves that P = NP.
doi: 10.6084/m9.figshare.1332492 , 10.6084/m9.figshare.1332492.v2
Subjects
arXiv: Computer Science::Discrete Mathematics
free text keywords: 80309 Software Engineering, FOS: Computer and information sciences, Computer Software, Computation Theory and Mathematics, Theoretical Computer Science, Algebra
Download fromView all 2 versions
figshare
Software . 2015
Provider: Datacite
figshare
Software . 2015
Provider: Datacite
figshare
Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue