scientific article
From MaRDI portal
Publication:3972008
zbMath0749.05061MaRDI QIDQ3972008
Publication date: 25 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
generalized Fibonacci numbersgossiptelephone problem\(k\)-conference calls problem\(k\)-telegraph problem
Social networks; opinion dynamics (91D30) Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10) General systems theory (93A99) Graph theory (05C99) Communication theory (94A05)
Related Items (7)
Methods and problems of communication in usual networks ⋮ Gossiping and broadcasting versus computing functions in networks ⋮ Note on optimal gossiping in some weak-connected graphs ⋮ Gossiping in vertex-disjoint paths mode in interconnection networks ⋮ Gossiping and broadcasting versus computing functions in networks. ⋮ Lower bounds on systolic gossip ⋮ Quick gossiping by telegraphs
This page was built for publication:
