Distributed algorithms on rooted undirected graphs
Distributed algorithms of solving problems on undirected graphs are considered. In section 2, a model is defined featuring a root as a starting and ending point of the algorithm execution. Synchronous and asynchronous versions of the model are described. In section 3, algorithms of solving any probl...
| Published in: | Труды Института системного программирования РАН |
|---|---|
| Main Authors: | , , |
| Format: | Article |
| Language: | English |
| Published: |
Russian Academy of Sciences, Ivannikov Institute for System Programming
2018-10-01
|
| Subjects: | |
| Online Access: | https://ispranproceedings.elpub.ru/jour/article/view/362 |