Broadcasting Multiple Messages Using Cycle-Rooted Trees

No abstract is available for this paper.

• Publication year

  2009

• Venue

  International Conference on Parallel and Distributed Computing: Applications and Technologies

• Publication date

  2009-12-08

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/PDCAT.2009.43
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• On generalized gossiping and broadcasting

  2006influential reference
• Variations of the prize-collecting Steiner tree problem

  2006cited by this paper
• k‐Broadcasting in trees

  2001cited by this paper
• Completely independent spanning trees in the underlying graph of a line digraph

  2000cited by this paper
• An Optimal Algorithm for Broadcasting Multiple Messages in Trees

  1999cited by this paper
• Dissemination of Information in Interconnection Networks (Broadcasting & Gossiping)

  1996cited by this paper
• Multiple message broadcasting in the postal model

  1993cited by this paper
• Broadcasting multiple messages in simultaneous send/receive systems

  1993cited by this paper
• Broadcasting and Spanning Trees in de Bruijn and Kautz Networks

  1992cited by this paper
• A survey of gossiping and broadcasting in communication networks

  1988cited by this paper

• No citing papers are available for this paper.