Label-connected graphs and the gossip problem
From MaRDI portal
Publication:804593
Recommendations
Cites work
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Problem with Telephones
- Edge-Disjoint Spanning Trees of Finite Graphs
- Further gossip problems
- Graph theory
- On the Problem of Decomposing a Graph into n Connected Factors
- The communication problem on graphs
Cited in
(6)- Connectivity and inference problems for temporal networks
- Reordered gossip schemes
- The complexity of computing optimum labelings for temporal connectivity
- Temporally connected components
- Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks
- Kernels of minimum size gossip schemes
This page was built for publication: Label-connected graphs and the gossip problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804593)