The complexity of finding a broadcast center

DOI10.1007/978-3-030-93176-6_6MaRDI QIDQ2151362zbMATH OpenOpenAlexFDO

Authors Hovhannes A. Harutyunyan, Zhiyuan Li

Publication date 1 July 2022

Full work available at URL https://doi.org/10.1007/978-3-030-93176-6_6

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Communication networks in operations research (90B18)

Recommendations

• On the complexity of broadcast setup
• Locating A Broadcast Facility In An Unreliable Network
• The do-all problem in broadcast networks
• scientific article; zbMATH DE number 975322
• The energy complexity of broadcast
• On the complexity of the shortest-path broadcast problem
• Feasibility and complexity of broadcasting with random transmission failures
• Feasibility and complexity of broadcasting with random transmission failures
• Complexity analysis of broadcasting in hypercubes with restricted communication capabilities
• Finding OR in a noisy broadcast network

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2079323 (Why is no real title available?)
• scientific article; zbMATH DE number 1775430 (Why is no real title available?)
• scientific article; zbMATH DE number 857072 (Why is no real title available?)
• A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem
• A linear algorithm for finding the k‐broadcast center of a tree
• A minimum broadcast graph on 26 vertices
• A new construction of broadcast graphs
• A simple construction of broadcast graphs
• A survey of gossiping and broadcasting in communication networks
• Antepenultimate broadcasting
• Broadcast networks with near optimal cost
• Broadcasting in heterogeneous tree networks
• Broadcasting on cactus graphs
• Compound constructions of broadcast networks
• Efficient construction of broadcast graphs
• Information Dissemination in Trees
• Linear Algorithm for Broadcasting in Unicyclic Graphs
• Methods and problems of communication in usual networks
• Minimal broadcast networks
• Minimum broadcast graphs
• More broadcast graphs
• New lower bounds on broadcast function
• On broadcasting in unicyclic graphs
• On the construction of minimal broadcast networks
• Some minimum broadcast graphs
• Sparse broadcast graphs
• Tight Bounds on Mimimum Broadcast Networks
• Upper bounds on the broadcast function using minimum dominating sets

Cited in

(2)

• Parameterized complexity of broadcasting in graphs
• scientific article; zbMATH DE number 1670545 (Why is no real title available?)

This page was built for publication: The complexity of finding a broadcast center

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2151362)