|
| | | | |
| | | |
| Stat |
Members: 3669
Articles: 2'599'751
Articles rated: 2609
16 March 2025 |
|
| | | | |
|
Article overview
| |
|
|
Modelling simultaneous broadcasting by level-disjoint partitions | | Petr Gregor
; Riste Skrekovski
; Vida Vukasinovic
; | | Date: |
5 Sep 2016 | | Abstract: | Simultaneous broadcasting of multiple messages from the same source vertex in
synchronous networks is considered under restrictions that each vertex receives
at most one message in a unit time step, every received message can be sent out
only in the next time step, no message is sent to already informed vertex. The
number of outgoing messages in unrestricted, messages have unit length, and we
assume full-duplex mode. In [9] we developed a concept of level-disjoint
partitions to study simultaneous broadcasting under this model. In this work we
consider the optimal number of level-disjoint partitions. We also provide a
necessary condition in terms of eccentricity and girth on existence of $k$
$v$-rooted level-disjoint partitions of optimal height. In particular, we
provide a structural characterization of graphs admitting two level-disjoint
partitions with the same root. | | Source: | arXiv, 1609.1116 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
|
| |
|
|
|
REGISTER