✦ LIBER ✦

Almost Safe Gossiping in Bounded Degree Networks

✍ Scribed by Diks, Krzysztof; Pelc, Andrzej

Book ID: 118196881
Publisher: Society for Industrial and Applied Mathematics
Year: 1992
Tongue: English
Weight: 874 KB
Volume: 5
Category: Article
ISSN: 0895-4801
DOI: 10.1137/0405025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Almost-Spanning Subgraphs with Bounded D

Almost-Spanning Subgraphs with Bounded Degree in Dense Graphs

✍ Yoshiyasu Ishigami 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 330 KB

We present two extensions of a theorem by Alon and Yuster (1992, Graphs Comb., 8, 95-102) that give degree conditions guaranteeing an almost-spanning subgraph isomorphic to a given graph. The first extension gives a sharp degree condition when the desired subgraph consists of small connected compone

Fast consensus in networks of bounded de

Fast consensus in networks of bounded degree

✍ Piotr Berman; Juan A. Garay 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 964 KB

Tolerating a Linear Number of Faults in

Tolerating a Linear Number of Faults in Networks of Bounded Degree

✍ E. Upfal 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 363 KB

Agreement in the presence of faults, on

Agreement in the presence of faults, on networks of bounded degree

✍ Michael Ben-Or; Dana Ron 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 540 KB

A Near Optimal Periodic Transmission Sch

A Near Optimal Periodic Transmission Schedule in Bounded Degree Wireless Sensor Network

✍ Bala Kalyanasundaram, Mahe Velauthapillai 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 567 KB

The non-uniform Bounded Degree Minimum D

The non-uniform Bounded Degree Minimum Diameter Spanning Tree problem with an application in P2P networking

✍ Chawachat, Jakarin; Fakcharoenphol, Jittat; Jindaluang, Wattana 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 158 KB