A linear algorithm for finding the k‐broadcast center of a tree

DOI10.1002/net.20270zbMath1175.68295OpenAlexW4230024666MaRDI QIDQ5191149

Bin Shao, Arthur L. Liestman, Hovhannes A. Harutyunyan

Publication date: 28 July 2009

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20270

zbMATH Keywords

graphcenterlinear algorithm\(k\)-broadcasting

Mathematics Subject Classification ID

Trees (05C05) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

The complexity of finding a broadcast center ⋮ All-to-all broadcast problem of some classes of graphs under the half duplex all-port model ⋮ All-to-all broadcast problems on Cartesian product graphs ⋮ Broadcasting in weighted trees under the postal model

Cites Work

• Unnamed Item
• Broadcasting in DMA-bound bounded degree graphs
• Methods and problems of communication in usual networks
• The complexity of broadcasting in planar and decomposable graphs
• Gossiping and broadcasting versus computing functions in networks.
• Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
• On the monotonicity of the broadcast function
• An efficient heuristic for broadcasting in networks
• Sublogarithmic approximation for telephone multicast
• Improved upper and lower bounds fork-broadcasting
• An algorithm for constructing minimalc-broadcast networks
• k-Broadcasting in trees
• A survey of gossiping and broadcasting in communication networks
• Information Dissemination in Trees
• Approximation Algorithms for Minimum-Time Broadcast
• Tight Bounds on Mimimum Broadcast Networks

This page was built for publication: A linear algorithm for finding the k‐broadcast center of a tree