Abstract

Broadcasting is the information dissemination process in a communication network. A subset of processors V0 (V called originators knows an unique message which has to be transferred by calls between adjacent processors. Each call requires one time unit and each processor can participate in at most one call per time unit. The problem is to find a schedule such that the time needed to inform all processors is less than or equal to a deadline k e IN. We present NP-completeness results for this problem restricted to several communication networks (bipartite planar graphs, grid graphs, complete ρid graphs, split graphs and chordal graphs) with constant deadline k=2 or one originator V0={v}.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.