Advertisement
If you have a new account but are having problems posting or verifying your account, please email us on hello@boards.ie for help. Thanks :)
Hello all! Please ensure that you are posting a new thread or question in the appropriate forum. The Feedback forum is overwhelmed with questions that are having to be moved elsewhere. If you need help to verify your account contact hello@boards.ie

Asynchronous Message Passing, BFS Algorithm

Options
  • 03-05-2015 8:36pm
    #1
    humham0517
    Registered Users Posts: 3 ✭


    distributed Bellman-Ford Algorithm for constructing a BFS tree in
    an asynchronous message passing system. The time complexity of the algorithm is O(D) and the message complexity is O(mn), where D is the diameter of the graph, n the number of nodes and m the number of edges. The number of edges in any graph is in O(n2), which implies an upper bound of O(n3) on the number of messages. Find a graph and an execution of the algorithm in which (n3) messages are sent and explain your solution


Advertisement