Zobrazeno 1 - 7
of 7
pro vyhledávání: '"корневой граф"'
Publikováno v:
Труды Института системного программирования РАН, Vol 30, Iss 1, Pp 69-88 (2018)
The paper provides a review of distributed graph algorithms research conducted by authors. We consider an asynchronous distributed system model represented by a strongly connected directed rooted graph with bounded edge capacity (in a sense that only
Externí odkaz:
https://doaj.org/article/1d0f71207fef455e956026fea46bb62d
Autor:
I. B. Burdonov, A. S. Kossatchev
Publikováno v:
Труды Института системного программирования РАН, Vol 30, Iss 2, Pp 167-194 (2018)
For a distributed system based on a directed graph without multiple edges and loops, the backtracing problem is considered: how to transfer a message from the final vertex of the arc to its initial vertex. The task is to create a structure on the gra
Externí odkaz:
https://doaj.org/article/756834a0b1794c0ea97e29e48e18680d
Autor:
I. B. Burdonov, A. S. Kossatchev
Publikováno v:
Труды Института системного программирования РАН, Vol 29, Iss 2, Pp 7-26 (2018)
The paper considers boundaries of memory necessary and sufficient for storage of undirected ordered rooted connected graphs, both numbered and unnumbered. The introduction contains the basic definitions and the problem statement. A graph is rooted if
Externí odkaz:
https://doaj.org/article/014885cb1c1f42c9851e67fae6579da6
Publikováno v:
Труды Института системного программирования РАН, Vol 30, Iss 1, Pp 69-88 (2018)
The paper provides a review of distributed graph algorithms research conducted by authors. We consider an asynchronous distributed system model represented by a strongly connected directed rooted graph with bounded edge capacity (in a sense that only
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::59d4569972414894fc9a0c5dccae12bf
https://doi.org/10.15514/ispras-2018-30(1)-5
https://doi.org/10.15514/ispras-2018-30(1)-5
Autor:
I. B. Burdonov, A. S. Kossatchev
Publikováno v:
Труды Института системного программирования РАН, Vol 29, Iss 2, Pp 7-26 (2018)
The paper considers boundaries of memory necessary and sufficient for storage of undirected ordered rooted connected graphs, both numbered and unnumbered. The introduction contains the basic definitions and the problem statement. A graph is rooted if
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ff3ea33d873e5c96fc758c51e090ae02
https://doi.org/10.15514/ispras-2017-29(2)-1
https://doi.org/10.15514/ispras-2017-29(2)-1
Publikováno v:
Прикладная дискретная математика. Приложение.
Получена точная формула для числа помеченных цветочно-колёсных графов с заданным количеством вершин и лепестков.
The exact formula is obtained for t
The exact formula is obtained for t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2806::1bf5350429eabf6610c3fa3170aaf027
http://cyberleninka.ru/article/n/perechislenie-pomechennyh-tsvetochno-kolyosnyh-grafov
http://cyberleninka.ru/article/n/perechislenie-pomechennyh-tsvetochno-kolyosnyh-grafov
Publikováno v:
Математические машины и системы.
Рассмотрен подход к анализу и синтезу оптимальных многоуровневых схем принятия решения применительно к системам, структура которых (ил
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2806::0191c3a0c7349de874458a0f22233a94
http://cyberleninka.ru/article/n/ob-odnom-podhode-k-analizu-i-sintezu-obnaruzhiteley-realnogo-vremeni-mnogourovnevyh-shemah-prinyatiya-resheniya
http://cyberleninka.ru/article/n/ob-odnom-podhode-k-analizu-i-sintezu-obnaruzhiteley-realnogo-vremeni-mnogourovnevyh-shemah-prinyatiya-resheniya