The complexity of broadcasting in bounded-degree networks

Details The complexity of broadcasting in bounded-degree networks The complexity of broadcasting in bounded-degree networks

1994-11-18

arxiv.org/abs/math/9411222v1

Mathematics

Combinatorics

6 pages

Scientific paper

Broadcasting concerns the dissemination of a message originating at one node of a network to all other nodes. This task is accomplished by placing a series of calls over the communication lines of the network between neighboring nodes, where each call requires a unit of time and a call can involve only two nodes. We show that for bounded-degree networks determining the minimum broadcast time from an originating node remains NP-complete.

Affiliated with

Also associated with

No associations

Rating

The complexity of broadcasting in bounded-degree networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The complexity of broadcasting in bounded-degree networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The complexity of broadcasting in bounded-degree networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-657309