A. Prolubnikov

activity

20022023

most citedHeuristic algorithm for solving of the graph isomorphism problem

1 citations · 3 across the 8 of their papers we have counts for

collaborators

Showing cs.DMShow all

2 papers · 1 filter

cs.DM2023

Finding the connected components of the graph using perturbations of the adjacency matrix

Alexander Prolubnikov

The problem of finding the connected components of a graph is considered. The algorithms addressed to solve the problem are used to solve such problems on graphs as problems of fin…

cs.DM2015★ 1 cited

Reduction of the graph isomorphism problem to equality checking of $n$ -variables polynomials and the algorithms that use the reduction

Alexander Prolubnikov

The graph isomorphism problem is considered. We assign modified $n$ -variable characteristic polynomials for graphs and reduce the graph isomorphism problem to the problem of the po…

Finding the connected components of the graph using perturbations of the adjacency matrix

Reduction of the graph isomorphism problem to equality checking of n-variables polynomials and the algorithms that use the reduction

Reduction of the graph isomorphism problem to equality checking of $n$ -variables polynomials and the algorithms that use the reduction