Highly Influenced

# Towards Overcoming the Transitive-Closure Bottleneck: Efficient Parallel Algorithms for Planar Digraphs

@inproceedings{Kao1990TowardsOT, title={Towards Overcoming the Transitive-Closure Bottleneck: Efficient Parallel Algorithms for Planar Digraphs}, author={Ming-Yang Kao and Philip N. Klein}, booktitle={STOC}, year={1990} }

- Published 1990 in STOC
DOI:10.1145/100216.100237

1. I n t roduc t i on . In its simpliest form, the di. graph reachability problem is to test whether a graph contains a directed path from a given vertex to another. The best sequential algorithms for the problem use simple graph searches and run in optimal linear time [3]. In contrast, all known polylog-time parallel algorithms for the problem compute the transitive closure of the given graph; the best of them currently uses O(n 2"3~6) processors for an n-vertex graph [21], [12], [7]. Thus… CONTINUE READING

#### From This Paper

##### Figures, tables, results, connections, and topics extracted from this paper.

19 Extracted Citations

4 Extracted References

Similar Papers

#### Referenced Papers

##### Publications referenced by this paper.

Showing 1-4 of 4 references

Highly Influential

Highly Influential

Highly Influential

Highly Influential