Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps
We deal with the problem of maintaining a shortest-path tree rooted at some process r in a network that may be disconnected after topological changes. The goal is then to maintain a shortest-path tree rooted at r in its connected component, V_r, and make all processes of other components detecting t...
Збережено в:
| Автори: | , , |
|---|---|
| Формат: | Artigo |
| Мова: | Inglês |
| Опубліковано: |
Discrete Mathematics & Theoretical Computer Science
2017-11-01
|
| Серія: | Discrete Mathematics & Theoretical Computer Science |
| Предмети: | |
| Онлайн доступ: | https://dmtcs.episciences.org/3181/pdf |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|