scientific article
From MaRDI portal
Publication:3886878
zbMath0443.68049MaRDI QIDQ3886878
Arthur M. Farley, Andrzej Proskurowski
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of graph theory to circuits and networks (94C15)
Related Items (11)
Methods and problems of communication in usual networks ⋮ Traffic-light scheduling on the grid ⋮ Note on the problem of gossiping in multidimensional grids ⋮ Broadcasting on \([0,L\)] ⋮ Note on optimal gossiping in some weak-connected graphs ⋮ Effective systolic algorithms for gossiping in cycles and two-dimensional grids ⋮ Asymptotically optimal gossiping in radio networks ⋮ Set to set broadcasting in communication networks ⋮ Optimal algorithms for dissemination of information in some interconnection networks ⋮ Neighborhood Communications in Networks ⋮ Graph theoretical issues in computer networks
This page was built for publication:
