Linear election in pancake graphs

Authors:
Adnan Mohamed;R. S. Ramakrishna
Affiliations:
Department of Information and Communications, Gwangju Institute of Science and Technology, 1 Oryong-dong, Gwangju, Republic of Korea;Department of Information and Communications, Gwangju Institute of Science and Technology, 1 Oryong-dong, Gwangju, Republic of Korea
Venue:
Information Processing Letters
Year:
2008

Citing 4
Cited 0

A Group-Theoretic Model for Symmetric Interconnection Networks

IEEE Transactions on Computers
A modular technique for the design of efficient distributed leader finding algorithms

ACM Transactions on Programming Languages and Systems (TOPLAS)
Introduction to distributed algorithms

Introduction to distributed algorithms
Parallel Solutions of Large Dense Linear Systems Using MPI

PARELEC '02 Proceedings of the International Conference on Parallel Computing in Electrical Engineering

Quantified Score

Hi-index	0.89

Visualization

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.