Broadcast Networks of Bounded Degree
From MaRDI portal
Recommendations
Cited in
(62)- An approximation algorithm and dynamic programming for reduction in heterogeneous environments
- Extremal broadcasting problems
- Broadcasting in the butterfly network
- Sparse broadcast graphs
- Broadcasting in DMA-bound bounded degree graphs
- Minimum broadcast digraphs
- Optimal algorithms for dissemination of information in some interconnection networks
- On the construction of regular minimal broadcast digraphs
- Graph theoretical issues in computer networks
- Bounded-call broadcasting
- Methods and problems of communication in usual networks
- Broadcasting in butterfly and deBruijn networks
- Note on optimal gossiping in some weak-connected graphs
- The complexity of broadcasting in planar and decomposable graphs
- Line broadcasting in cycles
- Time-relaxed broadcasting in communication networks
- Bounded-hop communication networks
- Lower bounds on systolic gossip
- Sparse hypercube -- a minimal \(k\)-line broadcast graph.
- Bounded depth broadcasting
- A simple construction of broadcast graphs
- An efficient heuristic for broadcasting in networks
- An efficient network-wide broadcasting based on hop-limited shortest-path trees
- Binary linear programming models for robust broadcasting in communication networks
- One-dimensional radio broadcast problem
- An optimal family of directed, bounded-degree broadcast networks
- Nonadaptive broadcasting in trees
- scientific article; zbMATH DE number 3859049 (Why is no real title available?)
- scientific article; zbMATH DE number 3869385 (Why is no real title available?)
- Broadcasting in Sierpinski gasket graphs
- scientific article; zbMATH DE number 4062584 (Why is no real title available?)
- scientific article; zbMATH DE number 4102999 (Why is no real title available?)
- Broadcasting in Bounded Degree Graphs
- Broadcasting in generalized chordal rings
- Minimal path broadcast networks
- scientific article; zbMATH DE number 2080980 (Why is no real title available?)
- scientific article; zbMATH DE number 1743971 (Why is no real title available?)
- Degree- and time-constrained broadcast networks
- All-port line broadcasting in highly connected graphs
- scientific article; zbMATH DE number 219254 (Why is no real title available?)
- Broadcasting with universal lists
- Multiple message broadcasting in communication networks
- Antepenultimate broadcasting
- Network information broadcasting in narrow band self-organizing networks
- Broadcasting in butterfly and deBruijn networks (extended abstract)
- scientific article; zbMATH DE number 3893100 (Why is no real title available?)
- Tight Bounds on Mimimum Broadcast Networks
- Broadcast networks with near optimal cost
- Data transmission in processor networks
- Broadcasting in general networks I: Trees
- The complexity of broadcasting in planar and decomposable graphs
- Messy broadcasting - decentralized broadcast schemes with limited knowledge
- Throughput and packet displacements of dynamic broadcasting algorithms
- A note to non-adaptive broadcasting
- A linear-time optimal broadcasting algorithm in stars of cliques
- The minimum broadcast time problem for several processor networks
- Broadcasting in stars of cliques
- On time-relaxed broadcasting networks
- On the complexity of telephone broadcasting from cacti to bounded pathwidth graphs
- On the number of broadcast schemes in networks
- A generalized broadcasting schema for the mesh structures
- Broadcasting from multiple originators
This page was built for publication: Broadcast Networks of Bounded Degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3813762)
