Efficient parallel algorithms for computing all pair shortest paths in directed graphs (Q676269): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Pan, Victor Y. / rank
Normal rank
 
Property / author
 
Property / author: Pan, Victor Y. / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Matrix and Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary Trees and Parallel Scheduling Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Bounds on the Complexity of the Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved parallel algorithm that computes the BFS numbering of a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Shortest Paths in Sparse Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Work-Preserving Speed-Up of Parallel Matrix Computations / 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: The parallel computation of minimum cost paths in graphs by stream contraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Parallel Algorithms for Sorting and Selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new upper bound on the complexity of the all pairs shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelism in Comparison Problems / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02523680 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2033740214 / rank
 
Normal rank

Latest revision as of 08:54, 30 July 2024

scientific article
Language Label Description Also known as
English
Efficient parallel algorithms for computing all pair shortest paths in directed graphs
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references