On broadcasting in unicyclic graphs

DOI10.1007/s10878-008-9160-2zbMath1165.94304OpenAlexW1998169461MaRDI QIDQ1029711

Hovhannes A. Harutyunyan, Edward Maraachlian

Publication date: 13 July 2009

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-008-9160-2

zbMATH Keywords

algorithmsunicyclic graphbroadcasting

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph algorithms (graph-theoretic aspects) (05C85) Communication theory (94A05)

Related Items (5)

The complexity of finding a broadcast center ⋮ Broadcasting in split graphs ⋮ Approximation algorithms in graphs with known broadcast time of the base graph ⋮ Broadcasting on cactus graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Methods and problems of communication in usual networks
• An efficient heuristic for broadcasting in networks
• Randomized broadcast in networks
• Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem
• Linear Algorithm for Broadcasting in Unicyclic Graphs
• A survey of gossiping and broadcasting in communication networks
• Information Dissemination in Trees
• Approximation Algorithms for Minimum-Time Broadcast

This page was built for publication: On broadcasting in unicyclic graphs