По вашему запросу найдено документов: 24810
Страница 12 из 2481
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
On Accuracy of Approximation for the Resource Constrained Shortest Path Problem-
hard extension of a well-known shortest path problem in the directed graph G = (V;E). In the RCSP
The bases of weighted graphs, minimal connected graphs, Hasse diagrams and so on) that are defined on graphs. Although they have
Graph-Based Recognition of High-Level Structures in Transistor Circuits predefined cell library. Graph-based methods are proposed for solving some key problems of subcircuit (CMOS
Graph Neural Networks for Communication Networks: A Survey networks, the most advanced
deep learning method, Graph Neural Network (GNN), has been
applied
Improving efficiency of VF3 and VF3-light algorithms for sparse graphs in labeled or unlabeled
graphs by focusing on effi ciency. One group of algorithms,
known as the VF series
ПРЕИМУЩЕСТВА ИСПОЛЬЗОВАНИЯ ГРАФОВЫХ БАЗ ДАННЫХ ПРИ РАЗРАБОТКЕ ПРИКЛАДНЫХ ПРИЛОЖЕНИЙThe article provides an overview of the advantages of graph databases, the differences between
Use of steiner problem in solving practical problems of road construction for three points. While carrying out this work, there was learnt the basics of graph theory, the methods
Assessment of tautomer distribution using the condensed reaction graph approach molecular graph (“condensed reaction graph”) which enables to compute molecular descriptors characterizing
Страница 12 из 2481
Фасеты
Партнеры
Индексация
