On the Solution of Graph Isomorphism by Dynamical Algorithms

Simple item page
dc.creatorGolovkins, Marats
dc.date2005-05-27
dc.date.accessioned2026-07-07T03:23:03Z
dc.date.available2026-07-07T03:23:03Z
dc.descriptionIn the recent years, several polynomial algorithms of a dynamical nature have been proposed to address the graph isomorphism problem. In this paper we propose a generalization of an approach exposed in cond-mat/0209112 and find that this dynamical algorithm is covered by a combinatorial approach. It is possible to infer that polynomial dynamical algorithms addressing graph isomorphism are covered by suitable polynomial combinatorial approaches and thus are tackled by the same weaknesses as the last ones.
dc.description20 pages
dc.identifierhttps://arxiv.org/abs/cs/0505076
dc.identifierhttp://arxiv.org/abs/cs/0505076
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32793
dc.subjectComputational Complexity
dc.subjectG.2.2
dc.titleOn the Solution of Graph Isomorphism by Dynamical Algorithms
dc.typetext

Files

Collections

arXiv