Antepenultimate broadcasting
From MaRDI portal
Publication:4894875
Recommendations
Cited in
(36)- Line broadcasting in cycles
- On the structure of minimum broadcast digraphs
- Minimum linear gossip graphs and maximal linear \((\Delta,k)\)-gossip graphs
- Sparse broadcast graphs
- More broadcast graphs
- On broadcast schemes of Knödel graphs
- A minimum broadcast graph on 26 vertices
- Broadcast Networks of Bounded Degree
- Improved upper and lower bounds for \(k\)-broadcasting
- Broadcast graphs using new dimensional broadcast schemes for Knödel graphs
- A COMPOUNDING ALGORITHM FOR 1-FAULT TOLERANT BROADCAST NETWORKS
- Efficient construction of broadcast graphs
- An algorithm for constructing minimal \(c\)-broadcast networks
- The complexity of finding a broadcast center
- Lower bounds for the size in four families of minimum broadcast graphs
- Broadcasting from multiple originators
- Time-relaxed broadcasting in communication networks
- Bounded depth broadcasting
- A new construction of broadcast graphs
- On the number of broadcast schemes in networks
- A 1-relaxed minimum broadcast graph on 15 vertices.
- Sparse hypercube -- a minimal \(k\)-line broadcast graph.
- Oriented hypercubes
- Time-relaxed Multi-Broadcasting in Communication Networks (EXTENDED ABSTRACT)
- Domination in 4-regular Knödel graphs
- The shortest path problem in the Knödel graph
- Compound constructions of broadcast networks
- Binary linear programming models for robust broadcasting in communication networks
- Hierarchical broadcast networks
- Broadcast graphs using new dimensional broadcast schemes for Knödel graphs
- Tight lower bounds on broadcast function for \(n = 24\) and 25
- Diametral broadcast graphs
- A new construction of broadcast graphs
- scientific article; zbMATH DE number 1538541 (Why is no real title available?)
- Methods and problems of communication in usual networks
- The broadcast function value \(B(23)\) is \(33\) or \(34\).
This page was built for publication: Antepenultimate broadcasting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4894875)