Prove that in any connected graph G we have T (G) = O(diam(G)cedge(G)).
Question:
Prove that in any connected graph G we have T
∗(G) =
O(diam(G)cedge(G)).
Step by Step Answer:
This question has not been answered yet.
You can Ask your question!
Related Book For 
Design And Analysis Of Distributed Algorithms
ISBN: 9780471719977
1st Edition
Authors: Nicola Santoro
Question Posted:
