Transitive reduction in parallel via branchings

Technical Report · Fri Jul 15 04:00:00 EDT 1988

OSTI ID:6980369

Gibbons, P; Karp, R; Remachandran, V; Soroker, D; Tarjan, R

We study the following problem: given a strongly connected digraph, find a minimal strongly connected spanning subgraph of it. Our main result is a parallel algorithm for this problem, which runs in polylog parallel time and uses O(n cubed) processors on a PRAM. Our algorithm is simple and the major tool it uses is computing a minimum-weight branching with zero-one weights. We also present sequential algorithms for the problem that run in time O(m+n.logn).

• Research Organization: Princeton Univ., NJ (USA). Dept. of Computer Science
• OSTI ID: 6980369
• Report Number(s): AD-A-215108/2/XAB; CS-TR--171-88
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990200* -- Mathematics & Computers
ALGORITHMS
COMPUTERS
ELECTRONIC CIRCUITS
MATHEMATICAL LOGIC
MICROELECTRONIC CIRCUITS
MICROPROCESSORS
PARALLEL PROCESSING
PROGRAMMING
TIME DEPENDENCE
USES