Graph equivalence and characterization via a continuous evolution of a physical analog

Simple item page
dc.creatorGudkov, Vladimir
dc.creatorNussinov, Shmuel
dc.date2002-09-04
dc.date2002-09-06
dc.date.accessioned2026-07-07T02:47:09Z
dc.date.available2026-07-07T02:47:09Z
dc.descriptionA general novel approach mapping discrete, combinatorial, graph-theoretic problems onto ``physical'' models - namely $n$ simplexes in $n-1$ dimensions - is applied to the graph equivalence problem. It is shown to solve this long standing problem in polynomial, short, time.
dc.descriptionRevTeX4
dc.identifierhttps://arxiv.org/abs/cond-mat/0209112
dc.identifierhttp://arxiv.org/abs/cond-mat/0209112
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/19898
dc.subjectStatistical Mechanics
dc.subjectDiscrete Mathematics
dc.subjectHigh Energy Physics - Phenomenology
dc.subjectCombinatorics
dc.subjectComputational Physics
dc.titleGraph equivalence and characterization via a continuous evolution of a physical analog
dc.typetext

Files

Collections

arXiv