Optimal graph algorithms on a fixed-size linear array

Journal Article · Wed Apr 01 00:00:00 EST 1987 · IEEE Trans. Comput.; (United States)

DOI:https://doi.org/10.1109/TC.1987.1676928· OSTI ID:6626807

Doshi, K A; Varman, P J

Parallel algorithms for computing the minimum spanning tree of a weighted undirected graph, and the bridges and articulation points of an undirected graphs on a fixed-size linear array of processors are presented. For a graph of n vertices, the algorithms operate on a linear array of rho processors and require O(n/sup 2//rho) time for all rho, 1 less than or equal to rho -- n. In particular, using n processors the algorithms require O(n) time which is optimal on this model. The paper describes two approaches to limit the communication requirements for solving the problems. The first is a divide-and-conquer strategy applied to Sollin's algorithm for finding the minimum spanning tree of a graph. The second uses a novel data-reduction technique that constructs an auxiliary graph with no more that 2n - 2 edges, whose bridges and articulation points are the bridges and articulation points of the original graph.

• Research Organization: Dept. of Electrical and Computer Engineering, Rice Univ., Houston, TX 77251-1892
• OSTI ID: 6626807
• Journal Information: IEEE Trans. Comput.; (United States), Vol. C-36:4
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
ARRAY PROCESSORS
PARALLEL PROCESSING
ALGORITHMS
GRAPHS
COMPUTER ARCHITECTURE
DATA TRANSMISSION
OPTIMIZATION
TIME DEPENDENCE
COMMUNICATIONS
MATHEMATICAL LOGIC
PROGRAMMING
990210* - Supercomputers- (1987-1989)