On the construction of minimal broadcast networks

DOI10.1002/NET.3230190606MaRDI QIDQ3832298zbMATH OpenOpenAlexFDO

Authors Luisa Gargano, Ugo Vaccaro

Publication date 1989

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230190606

zbMATH Keywords

communication networksminimal broadcast networks

Mathematics Subject Classification ID

Graph theory (05C99) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 3948154
• A new method for constructing minimal broadcast networks
• Broadcast networks with near optimal cost
• scientific article; zbMATH DE number 4141826
• Minimal path broadcast networks

Cited in

(33)

• An approximation algorithm and dynamic programming for reduction in heterogeneous environments
• Compound constructions of broadcast networks
• On the construction of regular minimal broadcast digraphs
• Graph theoretical issues in computer networks
• Bounded-call broadcasting
• Time-relaxed broadcasting in communication networks
• The even adjacency split problem for graphs
• Sparse hypercube -- a minimal \(k\)-line broadcast graph.
• More broadcast graphs
• The complexity of finding a broadcast center
• A new construction of broadcast graphs
• Diametral broadcast graphs
• Binary linear programming models for robust broadcasting in communication networks
• An algorithm for constructing minimal c-broadcast networks
• A new construction of broadcast graphs
• Hierarchical broadcast networks
• Optimization of the transfer of the broadcasting information in computer networks
• Broadcast graphs using new dimensional broadcast schemes for Knödel graphs
• Time-relaxed Multi-Broadcasting in Communication Networks (EXTENDED ABSTRACT)
• scientific article; zbMATH DE number 4141826 (Why is no real title available?)
• A COMPOUNDING ALGORITHM FOR 1-FAULT TOLERANT BROADCAST NETWORKS
• scientific article; zbMATH DE number 3948154 (Why is no real title available?)
• Tight lower bounds on broadcast function for n = 24 and 25
• Minimal path broadcast networks
• Broadcast networks with near optimal cost
• A new method for constructing minimal broadcast networks
• SOFSEM 2006: Theory and Practice of Computer Science
• Broadcast graphs using new dimensional broadcast schemes for Knödel graphs
• Broadcast schemes of hypercubes
• All sequential dimensional broadcast schemes in Knödel graphs
• On the number of broadcast schemes in networks
• Constructing minimum-interference networks
• Broadcasting from multiple originators

This page was built for publication: On the construction of minimal broadcast networks

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