Previous results Problem Collision Graph Completion detection time RB Without Bidirectional O(n) Arbitrary O(nlogn) RG Without Strongly connected On3/2 arb Without Bidirectional Unsolvable With Bidirectional O(n Bidirectional O(recc) Strongly connected n·eCC n:number of nodes, r: length of message, ecc: largest distance from the sourcePrevious results Problem Collision detection Graph Completion time RB Without Bidirectional O(n) Arbitrary O(nlog2n) RG Without Strongly connected O(n 3/2) ARB Without Bidirectional Unsolvable With Bidirectional O(n) Bidirectional O(r+ecc) Strongly connected O(n・ecc) n: number of nodes, r: length of message, ecc: largest distance from the source