Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs (Q1317488): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple parallel tree contraction algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A random NC algorithm for depth first search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Depth-First Search in General Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic parallel list ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster optimal parallel prefix sums and list ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3761691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nearly Optimal Parallel Algorithm for Constructing Depth First Spanning Trees in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel algorithms for planar graph isomorphism and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for graph four-connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3798260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Processor NC Algorithms for Planar Directed Graphs I: Strongly Connected Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Processor NC Algorithms for Planar Directed Graphs II: Directed Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient parallel algorithm for planarity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3798226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Prefix Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel ear decomposition search (EDS) and st-numbering in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding small simple cycle separators for 2-connected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and efficient solution of path algebra problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-first search is inherently sequential / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(logn) parallel connectivity algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithms for Depth-First Searches I. Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Transitive Closure and Point Location in Planar Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Parallel Biconnectivity Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3798261 / rank
 
Normal rank

Latest revision as of 13:40, 22 May 2024

scientific article
Language Label Description Also known as
English
Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs
scientific article

    Statements

    Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs (English)
    0 references
    0 references
    0 references
    18 September 1994
    0 references
    0 references
    0 references
    0 references
    0 references
    transitive closure
    0 references
    parallel algorithms
    0 references
    planar digraphs
    0 references
    digraph reachability
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references