Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs

Ming-Yang Kao, Philip N. Klein
<span title="">1993</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="" style="color: black;">Journal of computer and system sciences (Print)</a> </i> &nbsp;
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
more &raquo; ... 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.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="">doi:10.1016/0022-0000(93)90042-u</a> <a target="_blank" rel="external noopener" href="">fatcat:4jb5tnrxobdldlrbnzbzqa2wfy</a> </span>
<a target="_blank" rel="noopener" href="" 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="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href=""> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> </button> </a>