✦ LIBER ✦

A study of minimum gossip graphs

✍ Scribed by Guillaume Fertin

Book ID: 108316403
Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 294 KB
Volume: 215
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(99)00227-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some minimum gossip graphs

✍ Roger Labahn 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 715 KB

Minimum linear gossip graphs and maximal

Minimum linear gossip graphs and maximal linear (Δ, k)-gossip graphs

✍ Pierre Fraigniaud; Joseph G. Peters 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 227 KB

Compounding of gossip graphs

✍ Guillaume Fertin; Roger Labahn 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 262 KB

Gossiping refers to the following task: In a group of individuals connected by a communication network, every node has a piece of information and needs to transmit it to all the nodes in the network. The networks are modeled by graphs, where the vertices represent the nodes, and the edges, the commu

Cyclic gossiping times for some classes

Cyclic gossiping times for some classes of graphs

✍ Knisely, James A.; Laskar, Renu 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 574 KB

Gossiping and broadcasting are two problems of information dissemination described for a group of individuals connected by a communication network. In gossiping, every person in the network knows a unique item of information and needs to communicate it to everyone else. In broadcasting, one individu

Minimum rank of outerplanar graphs

✍ John Sinkovic; Mark Kempton 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 435 KB

Minimum Difference Representations of Gr

Minimum Difference Representations of Graphs

✍ József Balogh; Noah Prince 📂 Article 📅 2009 🏛 Springer Japan 🌐 English ⚖ 208 KB