The direct algorithm for solving of the graph isomorphism problem

Authors R. T. Faizullin, A. V. Prolubnikov

Publication date 12 February 2005

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Abstract: We 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.

This page was built for publication: The direct algorithm for solving of the graph isomorphism problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6475097)