The direct algorithm for solving of the graph isomorphism problem

Simple item page
dc.creatorFaizullin, Rashit T.
dc.creatorProlubnikov, Alexander V.
dc.date2005-02-12
dc.date2005-02-25
dc.date.accessioned2026-07-07T05:16:55Z
dc.date.available2026-07-07T05:16:55Z
dc.descriptionWe propose an algorithm for solving of the graph isomorphism problem. Also, we introduce the new class of graphs for which the graph isomorphism problem can be solved polynomially using the algorithm.
dc.description22 pages
dc.identifierhttps://arxiv.org/abs/math/0502251
dc.identifierhttp://arxiv.org/abs/math/0502251
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/74166
dc.subjectCombinatorics
dc.subject05C60
dc.titleThe direct algorithm for solving of the graph isomorphism problem
dc.typetext

Files

Collections

arXiv