The polynomial algorithm for graphs' isomorphism testing

Simple item page
dc.creatorGolubchik, Aleksandr
dc.date2002-02-09
dc.date.accessioned2026-07-07T04:46:22Z
dc.date.available2026-07-07T04:46:22Z
dc.descriptionA polynomial algorithm for graphs' isomorphism testing is constructed in assumption that there exists a corresponding polynomial algorithm for graphs with trivial automorphism group.
dc.description4 pages
dc.identifierhttps://arxiv.org/abs/math/0202085
dc.identifierhttp://arxiv.org/abs/math/0202085
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/63305
dc.subjectCombinatorics
dc.subjectGroup Theory
dc.subjectConbinatorics, Group theory, Graph theory
dc.titleThe polynomial algorithm for graphs' isomorphism testing
dc.typetext

Files

Collections

arXiv