✦ LIBER ✦

Note on optimal gossiping in some weak-connected graphs

✍ Scribed by Juraj Hromkovič; Claus-Dieter Jeschke; Burkhard Monien

Book ID: 107948814
Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 534 KB
Volume: 127
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)90049-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on dominating cycles in 2-connect

A note on dominating cycles in 2-connected graphs

✍ D. Bauer; E. Schmeichel; H.J. Veldman 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 277 KB

A note on the chromaticity of some 2-con

A note on the chromaticity of some 2-connected (n,n+3)-graphs

✍ F.M. Dong; K.L. Teo; K.M. Koh 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 77 KB

On some weaknesses existing in optimal g

On some weaknesses existing in optimal grasp planning

✍ Yu Zheng; Wen-Han Qian 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 498 KB

Some Notes on Signed Edge Domination in

Some Notes on Signed Edge Domination in Graphs

✍ H. Karami; S. M. Sheikholeslami; A. Khodkar 📂 Article 📅 2008 🏛 Springer Japan 🌐 English ⚖ 99 KB

[Lecture Notes in Computer Science] Comb

[Lecture Notes in Computer Science] Combinatorial Optimization Volume 7422 || Selective Graph Coloring in Some Special Classes of Graphs

✍ Mahjoub, A. Ridha; Markakis, Vangelis; Milis, Ioannis; Paschos, Vangelis Th. 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 225 KB

This book constitutes the thoroughly refereed post-conference proceedings of the Second International Symposium on Combinatorial Optimization, ISCO 2012, held in Athens, Greece, in April 2012. The 37 revised full papers presented together with 4 invited talks were carefully reviewed and selected fro

Notes on `divide-and-conquer-based optim

Notes on `divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model'

✍ Das, S.K.; Deo, N. 📂 Article 📅 1990 🏛 IEEE ⚖ 347 KB