scientific article; zbMATH DE number 1432346

MaRDI QIDQ4947332zbMATH OpenFDO

Authors E. A. Monakhova, O. G. Monakhov

Publication date 16 April 2000

zbMATH Keywords

circulants graphslower bounds for \(p\)-gossiping for circulantsparallel decentralized broadcasting and gossiping algorithmrouting algorithmstore-and-forward, full-duplex, and shouting model

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Communication networks in operations research (90B18) Fault detection; testing in circuits and networks (94C12)

Recommendations

• LATIN 2004: Theoretical Informatics
• Optimal algorithms for dissemination of information in some interconnection networks
• Publication:3359735
• Random walks, bisections and gossiping in circulant graphs
• Greedy routing in circulant networks

Cited in

(7)

• Greedy routing in circulant networks
• On the theoretical properties of the exchange algorithm
• Random walks and bisections in random circulant graphs
• A lower bound for the average number of hops in communication networks with circulant topologies of arbitrary degree
• On Finite Dimension Exchange Algorithms
• Random walks, bisections and gossiping in circulant graphs
• LATIN 2004: Theoretical Informatics

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 Q4947332)