Graph algorithms on a tree-structured parallel computer (Q797290): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A parallel algorithm for constructing minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel algorithms for some graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Matrix and Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing connected components on parallel computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions and Recurrences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel algorithms for the connected components and minimal spanning tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast, Efficient Parallel Algorithms for Some Graph Problems / rank
 
Normal rank

Revision as of 12:44, 14 June 2024

scientific article
Language Label Description Also known as
English
Graph algorithms on a tree-structured parallel computer
scientific article

    Statements

    Graph algorithms on a tree-structured parallel computer (English)
    0 references
    0 references
    0 references
    1984
    0 references
    SIMD computer
    0 references
    systolic computer
    0 references
    graph algorithm
    0 references
    time complexity
    0 references
    Parallel algorithms
    0 references
    tree-structured computer
    0 references
    connected components
    0 references
    transitive closure
    0 references
    minimum spanning tree
    0 references

    Identifiers