По вашему запросу найдено документов: 10519
Страница 1 из 1052
THE DEADLOCKS RESEARCH IN A DISTRIBUTED DATABASE, THE OBERMAK METHOD. There are certain transactions, indicating the agent on each node of the graph and implemented to build expectations
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
Графовые технологии в интеллектуальной системе комплексного анализа данных интернет-источников learning machine (for example, using neural networks) are based on graph embedding. This technology allows
First-order and monadic properties of highly sparse random graphs + 1/m (for any positive integer m). It is also well known that the random graph does not obey both k
On the doubly connected domination polynomial of a graph© 2019 World Scientific Publishing Company Let (Formula presented.) be a simple graph. A set
Development of the forecast model for management of the disbalance between the labor markets and educational services in the construction industry in the form of graphs is presented. On this basis, scenarios of social and economic development of the region
Embeddings of *-graphs into 2-surfacesThis paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question
Some results on prime labelings of graphsThe purpose of this paper is to give some new families of graphs that have a prime labeling
Some results on prime labelings of graphsThe purpose of this paper is to give some new families of graphs that have a prime labeling
Страница 1 из 1052
Фасеты
Партнеры
Индексация
