Time-relaxed Multi-Broadcasting in Communication Networks (EXTENDED ABSTRACT)

DOI10.1016/S1571-0653(04)00405-6MaRDI QIDQ3438992zbMATH OpenFDO

Authors Aditya Shastri

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

graphsnetworkscommunicationmulti-broadcasting

Mathematics Subject Classification ID

Communication theory (94A05) Applications of graph theory to circuits and networks (94C15) Network design and communication in computer systems (68M10)

Cites work

• scientific article; zbMATH DE number 4141826 (Why is no real title available?)
• scientific article; zbMATH DE number 177869 (Why is no real title available?)
• Antepenultimate broadcasting
• Information Dissemination in Trees
• Minimal broadcast networks
• Minimum broadcast graphs
• On the construction of minimal broadcast networks
• On the residue of a graph
• Sparse broadcast graphs
• Tight Bounds on Mimimum Broadcast Networks
• Time-relaxed Multi-Broadcasting in Communication Networks (EXTENDED ABSTRACT)
• Time-relaxed broadcasting in communication networks

Cited in

(1)

• Time-relaxed Multi-Broadcasting in Communication Networks (EXTENDED ABSTRACT)

This page was built for publication: Time-relaxed Multi-Broadcasting in Communication Networks (EXTENDED ABSTRACT)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3438992)