a. Show that an O(N log N) algorithm for election in planar networks exists.
b. Show that there exists an O(N log N) election algorithm for tori without a sense of direction. (Hint: analyse the performance of Tarry 's algorithm in tori.)
Text Book: Introduction to Distributed Algorithms By Gerard Tel.