Conflict-free broadcasting algorithms for graph traversals and their applications

Authors:
Gen-Huey Chen;Wei-Wen Liang
Affiliations:
Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan, Republic of China;Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan, Republic of China
Venue:
Parallel Computing
Year:
1992

Citing 6
Cited 1

Algorithms

Algorithms
Parallel Graph Algorithms Based Upon Broadcast Communications

IEEE Transactions on Computers
Distributed Sorting on Local Area Networks

IEEE Transactions on Computers
Log-logarithmic protocols for resolving ethernet and semaphore conflicts

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Broadcast Communications and Distributed Algorithms

IEEE Transactions on Computers
Tree algorithms for packet broadcast channels

IEEE Transactions on Information Theory

An Optimal Multiple Bus Network for Fan-in Algorithms

ICPP '97 Proceedings of the international Conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, using an adapted graph representation: double links adjacency arrays, we present conflict-free algorithms for solving some graph proglems under the single-channel broadcast communication model. These graph problems include depth first search, breadth first search, finding spanning trees, finding connected components, and finding articulation points and bridges. All the proposed algorithms broadcast 2n - 1 messages and run in O(n^2 / p) time when p processors are used, where 1