Linear election in pancake graphs

https://doi.org/10.1016/j.ipl.2007.10.017Get rights and content

Abstract

Pancake graphs have been proposed as an attractive alternative to hypercube networks. They have a smaller diameter and a lower degree. They also have a hierarchical structure which can be exploited in designing algorithms.

In this paper, we propose a leader election algorithm for oriented pancake graphs. The algorithm has a message complexity that is linear in the order of the graph.

References (7)

  • S.B. Akers et al.

    A group theoretic model for symmetric interconnection networks

    IEEE Transactions on Computers

    (1989)
  • R. Bagnara, A. Zaccagnini, Checking and bounding the solutions of some recurrence relations, Technical Report, Quaderno...
  • E. Korach et al.

    A modular technique for the design of efficient leader algorithms

    ACM Trans. Programming Languages and Systems

    (1990)
There are more references available in the full text version of this article.

Cited by (5)

View full text
Copyright © 2007 Elsevier B.V. All rights reserved.