New gossips and telephones
From MaRDI portal
Publication:1217126
DOI10.1016/0012-365X(75)90090-4zbMath0305.05001OpenAlexW2069843743MaRDI QIDQ1217126
Publication date: 1975
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(75)90090-4
Related Items (52)
Methods and problems of communication in usual networks ⋮ A minimum broadcast graph on 63 vertices ⋮ Unnamed Item ⋮ Note on optimal gossiping in some weak-connected graphs ⋮ Broadcasting multiple messages in the 1-in port model in optimal time ⋮ Optimal algorithms for broadcast and gossip in the edge-disjoint path modes ⋮ The exact gossiping problem ⋮ Optimal algorithms for broadcast and gossip in the edge-disjoint modes ⋮ The partial gossiping problem ⋮ Everyone knows that everyone knows ⋮ On equitable colouring of Knödel graphs ⋮ Optimal odd gossiping ⋮ Broadcast and gossip in line-communication mode ⋮ A new construction of broadcast graphs ⋮ The relationship between gossiping in vertex-disjoint paths mode and bisection width ⋮ Dynamic gossip ⋮ The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width ⋮ Domination in Kn\"odel Graphs ⋮ Broadcast graphs using new dimensional broadcast schemes for Knödel graphs ⋮ Power domination in Knödel graphs and Hanoi graphs ⋮ Maximum subgraph problem for 3-regular Knödel graphs and its wirelength ⋮ Gossiping in vertex-disjoint paths mode in interconnection networks ⋮ Diameter of General Knödel Graphs ⋮ 2-power domination number for Knödel graphs and its application in communication networks ⋮ Gossiping and routing in second-kind Frobenius graphs ⋮ Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs ⋮ Parallel algorithms for gossiping by mail ⋮ The epistemic gossip problem ⋮ Upper bounds on the broadcast function using minimum dominating sets ⋮ More broadcast graphs ⋮ A survey on Knödel graphs. ⋮ A class of solutions to the gossip problem. I ⋮ Diametral broadcast graphs ⋮ On linear-time data dissemination in dynamic rooted trees ⋮ The Pleasure of Gossip ⋮ Domination in 4-regular Knödel graphs ⋮ Unnamed Item ⋮ Odd gossiping ⋮ Complete rotations in Cayley graphs ⋮ On Gossiping with Faulty Telephone Lines ⋮ Set to set broadcasting in communication networks ⋮ Fast information sharing in a complete network ⋮ Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs ⋮ Spreading information by conferences ⋮ The shortest path problem in the Knödel graph ⋮ A New Construction of Broadcast Graphs ⋮ Gossips and telegraphs ⋮ Optimal computation of census functions in the postal model ⋮ Simple multi-party set reconciliation ⋮ On the structure of minimum broadcast digraphs ⋮ Hierarchical broadcast and gossip networks ⋮ Total domination in cubic Knodel graphs
Cites Work
This page was built for publication: New gossips and telephones
