Modelling simultaneous broadcasting by level-disjoint partitions

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Modelling simultaneous broadcasting by level-disjoint partitions

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Modelling simultaneous broadcasting by level-disjoint partitions

Popis výsledku anglicky

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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GA14-10799S" target="_blank" >GA14-10799S: Hyperkrychlové, grafové a hypergrafové struktury</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2018

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Applied Mathematics and Computation

ISSN

0096-3003

e-ISSN

—

Svazek periodika

325

Číslo periodika v rámci svazku

15. května

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

9

Strana od-do

15-23

Kód UT WoS článku

000424380800002

EID výsledku v databázi Scopus

2-s2.0-85039850367