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

DOI10.1016/S1571-0653(04)00405-6zbMATH Open1184.94284MaRDI QIDQ3438992FDOQ3438992

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

• Sparse broadcast graphs
• Minimum broadcast graphs
• Time-relaxed broadcasting in communication networks
• On the construction of minimal broadcast networks
• Minimal broadcast networks
• Information Dissemination in Trees
• Antepenultimate broadcasting
• Tight Bounds on Mimimum Broadcast Networks
• On the residue of a graph
• Title not available (Why is that?)
• Title not available (Why is that?)
• Time-relaxed Multi-Broadcasting in Communication Networks (EXTENDED ABSTRACT)

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)