Linear Broadcasting and N loglog N Election in Unoriented Hypercubes

. In this paper, we provide efficient broadcasting and electionalgorithms in unoriented hypercubes. First, O(N) broadcasting andtraversing algorithms are introduced, where N is the number of hypercubevertices. This answers affirmatively the open question statedin [Tel95a] whether linear-message broadcasting and traversing can beachieved on hypercubes without sense of direction. Moreover, by exploitingnew techniques we designed an O(N log log N) leader electionalgorithm. This is the first ...