✦ LIBER ✦

Broadcasting in random graphs

✍ Scribed by Alan Frieze; Michael Molloy

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 163 KB
Volume: 54
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)00033-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal and near-optimal broadcast in ra

Optimal and near-optimal broadcast in random graphs

✍ Edward R. Scheinerman; John C. Wierman 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 537 KB

On broadcasting in unicyclic graphs

✍ Hovhannes A. Harutyunyan; Edward Maraachlian 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 385 KB

Broadcasting with random faults

✍ Daniel Bienstock 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 1008 KB

Fault-tolerant broadcast graphs

✍ Arthur L. Liestman 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 555 KB

Minimum k-broadcast graphs

✍ J.-C. König; E. Lazard 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 647 KB

Wormhole broadcast in star graph network

Wormhole broadcast in star graph networks

✍ Shahram Latifi; Pradip K. Srimani 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 175 KB

We propose a new broadcasting algorithm in star graph connected networks with wormhole routing. We use the usual single-port communication model with intermediate node reception capability where a node can communicate with a single neighbor at any instant of time. Lower bound under the model is deri