An optimal PRAM algorithm for a spanning tree on trapezoid graphs

Authors:
Debashis Bera;Madhumangal Pal;Tapan K. Pal
Affiliations:
Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore-721 102, INDIA;Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore-721 102, INDIA;Department of Applied Mathematics with Oceanology and Computer Programming, Vidyasagar University, Midnapore-721 102, INDIA
Venue:
The Korean Journal of Computational & Applied Mathematics
Year:
2003

Citing 6
Cited 1

Data structures and network algorithms

Data structures and network algorithms
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

Combinatorica
A parallel algorithm for eliminating cycles in undirected graphs

Information Processing Letters
An O(log m) parallel algorithm for the minimum spanning tree problem

Information Processing Letters
An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs

Information Processing Letters
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)

Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)

An Optimal Parallel Algorithm for Constructing a Spanning Forest on Trapezoid Graphs

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let G be a graph with n vertices and m edges. The problem of constructing a spanning tree is to find a connected subgraph of G with n vertices and n - 1 edges. In this paper, we propose an O(log n) time parallel algorithm with O(n/log n) processors on an EREW PRAM for constructing a spanning tree on trapezoid graphs.