A Novel Approach Applied to the Largest Clique Problem

Simple item page
dc.creatorGudkov, Vladimir
dc.creatorNussinov, Shmuel
dc.creatorNussinov, Zohar
dc.date2002-09-17
dc.date.accessioned2026-07-07T02:47:18Z
dc.date.available2026-07-07T02:47:18Z
dc.descriptionA novel approach to complex problems has been previously applied to graph classification and the graph equivalence problem. Here we apply it to the NP complete problem of finding the largest perfect clique within a graph $G$.
dc.description20 pages, 15 figures
dc.identifierhttps://arxiv.org/abs/cond-mat/0209419
dc.identifierhttp://arxiv.org/abs/cond-mat/0209419
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/19964
dc.subjectCondensed Matter
dc.subjectDiscrete Mathematics
dc.subjectCombinatorics
dc.subjectComputational Physics
dc.titleA Novel Approach Applied to the Largest Clique Problem
dc.typetext

Files

Collections

arXiv