A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit <a rel="external noopener" href="http://cs.brown.edu/research/pubs/pdfs/1993/Kao-1993-TOT.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs
<span title="">1993</span>
<i title="Elsevier BV">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/p6ovb2qpkfenhmb7mcksobrcxq" style="color: black;">Journal of computer and system sciences (Print)</a>
</i>
Preserved Fulltext
Currently, there is a significant gap between the best sequential and parallel complexities of many fundamental problems related to digraph reachability. This complexity bottleneck essentially reflects a seemingly unavoidable reliance on transitive closure techniques in parallel algorithms for digraph reachability. To pinpoint the nature of the bottleneck, we de* velop a collection of polylog-time reductions among reachability problems. These reductions use only linear processors and work for
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0022-0000(93)90042-u">doi:10.1016/0022-0000(93)90042-u</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4jb5tnrxobdldlrbnzbzqa2wfy">fatcat:4jb5tnrxobdldlrbnzbzqa2wfy</a>
</span>
more »
... neral graphs. Furthermore, for planar digraphs, we give polylog-time algorithms for the following problems: (1) directed ear decomposition, (2) topological ordering, (3) digraph reachability, (4) descendent counting, and (5) depth-first search. These algorithms use only linear processors and therefore reduce the complexity to within a polylog factor of optimal.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170814071206/http://cs.brown.edu/research/pubs/pdfs/1993/Kao-1993-TOT.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/a8/1c/a81cc416fe1225a004e8f299978b71375e075965.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0022-0000(93)90042-u">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="external alternate icon"></i>
elsevier.com
</button>
</a>