scientific article; zbMATH DE number 4051664

MaRDI QIDQ3788037zbMATH OpenFDO

Authors Ernst L. Leiss

Publication date 1987

zbMATH Keywords

communication structuredirected graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Theory of operating systems (68N25) Deterministic network models in operations research (90B10)

Recommendations

• Communication and optimal hierarchical networks
• Communication in m-connected graphs
• Efficient structure of noisy communication networks
• Randomized communication and implicit graph representations
• On the structure of minimum communication overlap networks
• scientific article; zbMATH DE number 1696532
• Efficient communication in unknown networks
• Communication algorithms in k-ary n-cube interconnection networks
• Communication in bounded depth circuits

Cited in

(3)

• Embedding complete binary trees into hypercubes
• An \(O(\log N)\) algorithm to solve linear recurrences on hypercubes
• Locality, Communication, and Interconnect Length in Multicomputers

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3788037)