R. Shabtai

collaborators

2 papers

cs.DM2015

Line-Broadcasting in Complete k-Trees

Revital Hollander Shabtai, Yehuda Roditty

A line-broadcasting model in a connected graph $G = (V, E)$ , $∣ V ∣ = n$ , is a model in which one vertex, called the {\it originator} of the broadcast holds a message that has to be trans…

cs.DM2013

Efficient construction of broadcast graphs

A. Averbuch, R. Hollander Shabtai, Y. Roditty

A broadcast graph is a connected graph, $G = (V, E)$ , $∣ V ∣ = n$ , in which each vertex can complete broadcasting of one message within at most $t = ⌈ lo g n ⌉$ time units. A min…