scientific article

zbMath0733.68007MaRDI QIDQ3359735

Claus-Dieter Jeschke, Burkhard Monien, Juraj Hromkovič

Publication date: 1990

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

broadcastingshuffle-exchange networksweak-connected graphsoptimal gossiping in cycles

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Mathematical problems of computer architecture (68M07)

Related Items (10)

Optimal algorithms for dissemination of information in generalized communication modes ⋮ Methods and problems of communication in usual networks ⋮ Broadcasting in butterfly and deBruijn networks ⋮ Optimal algorithms for broadcast and gossip in the edge-disjoint path modes ⋮ Broadcasting in butterfly and debruijn networks ⋮ The complexity of broadcasting in planar and decomposable graphs ⋮ Data transmission in processor networks ⋮ Gossiping in vertex-disjoint paths mode in interconnection networks ⋮ Broadcasting in the butterfly network ⋮ The complexity of broadcasting in planar and decomposable graphs

This page was built for publication: