Chiara Pierucci

  • Citations Per Year
Learn More
We study the shortest-path broadcast problem in graphs and digraphs, where amessage has to be transmitted from a source node s to all the nodes along shortest paths, in the classical telephonemodel. For both graphs and digraphs, we show that the problem is equivalent to the broadcast problem in layered directed graphs. We then prove that this latter problem(More)
  • 1