Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Davidovsky, Maxim"'
Autor:
Kurapov, Sergey, Davidovsky, Maxim
A visualized graph is a powerful tool for data analysis and synthesis tasks. In this case, the task of visualization constitutes not only in displaying vertices and edges according to the graph representation, but also in ensuring that the result is
Externí odkaz:
http://arxiv.org/abs/2407.21578
Autor:
Kurapov, Sergey, Davidovsky, Maxim
The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a graph or sim
Externí odkaz:
http://arxiv.org/abs/2407.12045
Autor:
Kurapov, Sergey, Davidovsky, Maxim
In this monography, it is proposed to consider the concepts of spectra of edge cuts and edge cycles of a graph as a basic mathematical structure for solving the problem of graph isomorphism. An edge cut is defined by an edge and the vertices incident
Externí odkaz:
http://arxiv.org/abs/2406.08117
Autor:
Kurapov, Sergey, Davidovsky, Maxim
The Four color problem is closely related to other branches of mathematics and practical applications. More than 20 of its reformulations are known, which connect this problem with problems of algebra, statistical mechanics and planning. And this is
Externí odkaz:
http://arxiv.org/abs/2405.05270
Publikováno v:
Information Systems: Methods, Models & Applications; 2013, p152-161, 10p
Publikováno v:
Information Systems: Methods, Models & Applications; 2013, p87-95, 9p
Publikováno v:
Information & Communication Technologies in Education, Research & Industrial Applications; 2013, p163-189, 27p
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Ermolayev, Vadim, Davidovsky, Maxim
Publikováno v:
ACM International Conference Proceeding Series; Sep2012, Special section p1-12, 12p
Publikováno v:
Intelligent Distributed Computing IV; 2010, p179-190, 12p