Optimal parallel algorithms for multiple updates of minimum spanning trees (Q2366226): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Shaunak R. Pawagi / rank
Normal rank
 
Property / author
 
Property / author: Shaunak R. Pawagi / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for updating minimal 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: The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal parallel algorithms for multiple updates of minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel algorithms for graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(log n) algorithm for parallel update of minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast, Efficient Parallel Algorithms for Some Graph Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(logn) parallel connectivity algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding and Updating Spanning Trees and Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Parallel Biconnectivity Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On handling vertex deletion in updating minimum spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient parallel algorithm for updating minimum spanning trees / rank
 
Normal rank

Latest revision as of 18:10, 17 May 2024

scientific article
Language Label Description Also known as
English
Optimal parallel algorithms for multiple updates of minimum spanning trees
scientific article

    Statements

    Optimal parallel algorithms for multiple updates of minimum spanning trees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 June 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    CREW PRAM
    0 references
    updates
    0 references
    minimum spanning trees
    0 references
    efficient algorithm
    0 references
    parallel algorithms
    0 references
    bounds
    0 references
    bipartite graph
    0 references