Broadcasting on Random Directed Acyclic Graphs
© 1963-2012 IEEE. We study the following generalization of the well-known model of broadcasting on trees. Consider an infinite directed acyclic graph (DAG) with a unique source vertex X. Let the collection of vertices at distance k from X be called the k th layer, and suppose every non-source vertex...
| Автори: | , , |
|---|---|
| Інші автори: | |
| Формат: | Стаття |
| Мова: | English |
| Опубліковано: |
Institute of Electrical and Electronics Engineers (IEEE)
2021
|
| Онлайн доступ: | https://hdl.handle.net/1721.1/136548 |