engleski

An algorithm for determining graph isomorphism

In order to analyse and solve many problems in chemistry, molecules are modelled with mathematical objects called graphs. But the problem is that the many different graphs can model the same molecule. Since properties which we study and analyse are attributed to molecules, it is quite important to distinguish whether two graphs represent the same molecule or not. Therefore, the notion of isomorphism of graphs is introduced, and the problem of determining isomorphism of graphs arises. The purpose of this paper is to present the fastest algorithm known to date for solving that problem.

isomorphism, automorphism, graph invariant

nije evidentirano