Modelling simultaneous broadcasting by level-disjoint partitions
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F18%3A10384204" target="_blank" >RIV/00216208:11320/18:10384204 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1016/j.amc.2017.12.018" target="_blank" >https://doi.org/10.1016/j.amc.2017.12.018</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.amc.2017.12.018" target="_blank" >10.1016/j.amc.2017.12.018</a>
Alternative languages
Result language
angličtina
Original language name
Modelling simultaneous broadcasting by level-disjoint partitions
Original language description
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 vertices. The number of outgoing messages is unrestricted, messages have unit length, and we assume full-duplex mode. In Gregor et al. (2015), 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 nu-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.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA14-10799S" target="_blank" >GA14-10799S: Hybercubic, graph and hypergraph structures</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Applied Mathematics and Computation
ISSN
0096-3003
e-ISSN
—
Volume of the periodical
325
Issue of the periodical within the volume
15. května
Country of publishing house
US - UNITED STATES
Number of pages
9
Pages from-to
15-23
UT code for WoS article
000424380800002
EID of the result in the Scopus database
2-s2.0-85039850367