Structure analysis of an explanatory dictionary ontological graph that is easy to analyze and process. For that purpose an ontological
graph is often used. In this paper
Profiling of energy consumption by algorithms of shortest paths search in large dense graphs the shortest paths between
all pairs of
graph vertices, which allowed us to estimate the power consumption
ON THE GRAPH MODEL AND EQUIVALENCE OF BANYAN NETWORKS of constructing their
graph models and the isomorphism between the models. The basic definitions that let us
Requirements to methods of graph clustering at the aim of solving the shortest path problemIn this paper we considered utilization of
graph clustering results in scope of solving all
Библиотека JpGraph для визуализации данных визуализировать разнообразные типы данных. Одним из таких инструментов является библиотека Jp
Graph, разработанная
Towards the intersection of Big Data, AI and BlockchainTowards the
intersection of Big Data, AI and Blockchain
The palette index of Sierpiński triangle graphs and Sierpiński graphsThe palette of a vertex v of a
graph G in a proper edge coloring is the set of colors assigned
Доминирующие и окрестностные множества, вершинные покрытия в графах, vertex covers of
graphs and their properties, deduces formulae for
calculating the dominance number
First-order properties of bounded quantifier depth of very sparse random graphsWe say that a random
graph obeys the zero-one k-law if every property expressed by a first