Antepenultimate broadcasting
From MaRDI portal
Publication:4894875
DOI10.1002/net.3230260302zbMath0856.90046OpenAlexW4205796308MaRDI QIDQ4894875
Jean-Claude Bermond, Joseph G. Peters, Pierre Fraigniaud
Publication date: 7 October 1996
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230260302
Related Items
Binary linear programming models for robust broadcasting in communication networks, Hierarchical broadcast networks, Methods and problems of communication in usual networks, Oriented hypercubes, On the number of broadcast schemes in networks, The complexity of finding a broadcast center, Lower bounds for the size in four families of minimum broadcast graphs, Bounded depth broadcasting, A new construction of broadcast graphs, Improved upper and lower bounds fork-broadcasting, Line broadcasting in cycles, Time-relaxed broadcasting in communication networks, Tight lower bounds on broadcast function for \(n = 24\) and 25, A COMPOUNDING ALGORITHM FOR 1-FAULT TOLERANT BROADCAST NETWORKS, Broadcast graphs using new dimensional broadcast schemes for Knödel graphs, Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs, More broadcast graphs, Efficient construction of broadcast graphs, Diametral broadcast graphs, Domination in 4-regular Knödel graphs, Unnamed Item, An algorithm for constructing minimalc-broadcast networks, Broadcasting from multiple originators, Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs, A 1-relaxed minimum broadcast graph on 15 vertices., The shortest path problem in the Knödel graph, A minimum broadcast graph on 26 vertices, A New Construction of Broadcast Graphs, Sparse hypercube -- a minimal \(k\)-line broadcast graph., On the structure of minimum broadcast digraphs, The broadcast function value \(B(23)\) is \(33\) or \(34\)., Compound constructions of broadcast networks, Time-relaxed Multi-Broadcasting in Communication Networks (EXTENDED ABSTRACT)
