Pages that link to "Item:Q804593"
From MaRDI portal
The following pages link to Label-connected graphs and the gossip problem (Q804593):
Displaying 7 items.
- The e-mail gossip number and the connected domination number (Q1372291) (← links)
- Kernels of minimum size gossip schemes (Q1897431) (← links)
- Reordered gossip schemes (Q1923510) (← links)
- Connectivity and inference problems for temporal networks (Q5894823) (← links)
- Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks (Q6179710) (← links)
- Temporally connected components (Q6612544) (← links)
- The complexity of computing optimum labelings for temporal connectivity (Q6615311) (← links)