| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 428796 | Information Processing Letters | 2008 | 5 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
