2 citations · 4 across the 12 of their papers we have counts for
6 papers · 1 filter
Searching isomorphic graphs
Anatoly D. Plotnikov
To determine that two given undirected graphs are isomorphic, we construct for them auxiliary graphs, using the breadth-first search. This makes capability to position vertices in…
Polynomial-time algorithm for determining the graph isomorphism (v.2)
Anatoly D. Plotnikov
We develop the methodology of positioning graph vertices relative to each other to solve the problem of determining isomorphism of two undirected graphs. Based on the position of t…
On non-canonical solving the Satisfiability problem
Anatoly D. Plotnikov
We study the non-canonical method for solving the Satisfiability problem which given by a formula in the form of the conjunctive normal form. The essence of this method consists in…
Experimental Algorithm for the Maximum Independent Set Problem
Anatoly D. Plotnikov
We develop an experimental algorithm for the exact solving of the maximum independent set problem. The algorithm consecutively finds the maximal independent sets of vertices in an…
Formalization of the class of problems solvable by a nondeterministic Turing machine
Anatoly D. Plotnikov
The objective of this article is to formalize the definition of NP problems. We construct a mathematical model of discrete problems as independence systems with weighted elements.…
A class of problems of NP to be worth to search an efficient solving algorithm
Anatoly D. Plotnikov
We examine possibility to design an efficient solving algorithm for problems of the class \np. It is introduced a classification of \np problems by the property that a partial solu…