Graph-Theoretic Concepts in Computer Science

DOI10.1007/11604686MaRDI QIDQ5897565zbMATH OpenFDO

Authors Robert Elsässer, Thomas Sauerwald

Publication date 1 November 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Randomized algorithms (68W20) Communication networks in operations research (90B18)

Recommendations

• On randomized broadcasting in star graphs
• On the Runtime and Robustness of Randomized Broadcasting
• Radio communication in random graphs
• On the runtime and robustness of randomized broadcasting
• Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs

Cited in

(6)

• scientific article; zbMATH DE number 5139470 (Why is no real title available?)
• Bit complexity of order statistics on a distributed star network
• On the Runtime and Robustness of Randomized Broadcasting
• On the runtime and robustness of randomized broadcasting
• Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
• On randomized broadcasting in star graphs

This page was built for publication: Graph-Theoretic Concepts in Computer Science

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