Associative Parallel Algorithm for Dynamic Update of the Shortest Paths Tree
The paper proposes an efficient associative algorithm for dynamic update of the shortest paths tree of a directed weighted graph after deleting an edge. To this end, we provide the data structure and its building along with the STAR–machine that simulates the run of associative (content–addressable)...
| Հիմնական հեղինակ: | |
|---|---|
| Ձևաչափ: | Հոդված |
| Լեզու: | English |
| Հրապարակվել է: |
Yaroslavl State University
2013-04-01
|
| Շարք: | Моделирование и анализ информационных систем |
| Խորագրեր: | |
| Առցանց հասանելիություն: | https://www.mais-journal.ru/jour/article/view/202 |