k-Broadcasting in trees

DOI10.1002/net.1034zbMath0985.94063OpenAlexW1982676876MaRDI QIDQ2764999

Hovhannes A. Harutyunyan, Arthur L. Liestman

Publication date: 14 January 2002

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

treesvertices\(k\)-broadcasting

Mathematics Subject Classification ID

Trees (05C05) Applications of graph theory to circuits and networks (94C15)

Related Items (5)

Binary linear programming models for robust broadcasting in communication networks ⋮ 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 ⋮ A linear algorithm for finding the k‐broadcast center of a tree ⋮ Broadcasting in weighted trees under the postal model

Cites Work

• Extremal broadcasting problems
• Broadcasting in DMA-bound bounded degree graphs
• Methods and problems of communication in usual networks
• Minimum \(k\)-broadcast graphs
• Improved upper and lower bounds fork-broadcasting
• Fault-tolerant broadcast graphs
• A survey of gossiping and broadcasting in communication networks
• Tight Bounds on Mimimum Broadcast Networks

This page was built for publication: k-Broadcasting in trees