Cyclic gossiping times for some classes of graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199610)28:3<135::AID-NET2>3.0.CO;2-O" /><135::AID-NET2>3.0.CO;2-O 10.1002/(SICI)1097-0037(199610)28:3<135::AID-NET2>3.0.CO;2-OzbMath0865.90055OpenAlexW2125852152MaRDI QIDQ5689808

James Knisely, Renu C. Laskar

Publication date: 7 January 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199610)28:3<135::aid-net2>3.0.co;2-o

zbMATH Keywords

gossipingcommunication networkbroadcastinginformation disseminationcyclic gossiping

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

This page was built for publication: Cyclic gossiping times for some classes of graphs