1 citations · 3 across the 8 of their papers we have counts for
8 papers
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…
On the representativeness of approximate solutions of discrete optimization problems with interval objective function
Alexander Prolubnikov
We consider discrete optimization problems with interval uncertatinty of objective function coefficients. The interval uncertainty models measurements errors. A pos\-sible optimal…
The interval greedy algorithm for discrete optimization problems with interval objective function
Alexander Prolubnikov
We consider a wide class of the discrete optimization problems with interval objective function. We give a generalization of the greedy algorithm for the problems. Using the algori…
An estimation of the greedy algorithm's accuracy for a set cover problem instance
Alexander Prolubnikov
Considering the set cover problem, by modifying the approach that gives a logarithmic approximation guarantee for the greedy algorithm, we obtain an estimation of the greedy algori…
Reduction of the graph isomorphism problem to equality checking of -variables polynomials and the algorithms that use the reduction
Alexander Prolubnikov
The graph isomorphism problem is considered. We assign modified -variable characteristic polynomials for graphs and reduce the graph isomorphism problem to the problem of the po…
On a new complete invariant of acyclic graphs
A. Prolubnikov
A new complete invariant for acyclic graphs is presented