Модели случайных графов и их применения
АМ Райгородский - Труды Московского физико-технического …, 2010 - cyberleninka.ru
Модели случайных графов и их применения – тема научной статьи по математике
читайте бесплатно текст научно-исследовательской работы в электронной …
читайте бесплатно текст научно-исследовательской работы в электронной …
Cliques and cycles in distance graphs and graphs of diameters.
AM Raigorodskii - Discrete geometry and algebraic …, 2013 - books.google.com
Cliques and cycles in distance graphs and graphs of diameters. Page 102 Contemporary
Mathematics Volume 625 , 2014 http://dx. doi. org/10.1090/conm/625/12493 Cliques and cycles …
Mathematics Volume 625 , 2014 http://dx. doi. org/10.1090/conm/625/12493 Cliques and cycles …
Deadlock analysis and resolution for multi-robot systems
Collision avoidance for multirobot systems is a well studied problem. Recently, control
barrier functions (CBFs) have been proposed for synthesizing controllers that guarantee …
barrier functions (CBFs) have been proposed for synthesizing controllers that guarantee …
Constructing 5-chromatic unit distance graphs embedded in the Euclidean plane and two-dimensional spheres
VA Voronov, AM Neopryatnaya, EA Dergachev - Discrete Mathematics, 2022 - Elsevier
This paper is devoted to the development of algorithms for finding unit distance graphs with
chromatic number greater than 4, embedded in a two-dimensional sphere or plane. Such …
chromatic number greater than 4, embedded in a two-dimensional sphere or plane. Such …
[HTML][HTML] Embedding graphs in Euclidean space
The dimension of a graph G is the smallest d for which its vertices can be embedded in d-
dimensional Euclidean space in the sense that the distances between endpoints of edges …
dimensional Euclidean space in the sense that the distances between endpoints of edges …
Deadlock analysis and resolution in multi-robot systems (extended version)
Collision avoidance for multirobot systems is a well studied problem. Recently, control
barrier functions (CBFs) have been proposed for synthesizing controllers guarantee collision …
barrier functions (CBFs) have been proposed for synthesizing controllers guarantee collision …
GG-GAN: A geometric graph generative adversarial network
We study the fundamental problem of graph generation. Specifically, we treat graph
generation from a geometric perspective by associating each node with a position in space …
generation from a geometric perspective by associating each node with a position in space …
Lower bounds for the chromatic numbers of distance graphs with large girth
AA Sagdeev - Mathematical Notes, 2017 - Springer
Lower Bounds for the Chromatic Numbers of Distance Graphs with Large Girth Page 1 ISSN
0001-4346, Mathematical Notes, 2017, Vol. 101, No. 3, pp. 515–528. © Pleiades Publishing …
0001-4346, Mathematical Notes, 2017, Vol. 101, No. 3, pp. 515–528. © Pleiades Publishing …
Explicit unit distance graphs with exponential chromatic number and arbitrary girth
In 1975 Erd\H {o} s initiated the study of the following very natural question. What can be
said about the chromatic number of unit distance graphs in $\mathbb {R}^ 2$ that have large …
said about the chromatic number of unit distance graphs in $\mathbb {R}^ 2$ that have large …
The chromatic number of space with forbidden regular simplex.
A Sagdeev - Mathematical Notes, 2017 - search.ebscohost.com
The Chromatic Number of Space with Forbidden Regular Simplex Page 1 ISSN 0001-4346,
Mathematical Notes, 2017, Vol. 102, No. 4, pp. 541–546. © Pleiades Publishing, Ltd., 2017 …
Mathematical Notes, 2017, Vol. 102, No. 4, pp. 541–546. © Pleiades Publishing, Ltd., 2017 …