Improved processor bounds for parallel algorithms for weighted directed graphs (Q1209343): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2060929063 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimum branchings / 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: Transitive compaction in parallel via branchings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4385522 / rank | |||
Normal rank | |||
Latest revision as of 16:35, 17 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved processor bounds for parallel algorithms for weighted directed graphs |
scientific article |
Statements
Improved processor bounds for parallel algorithms for weighted directed graphs (English)
0 references
16 May 1993
0 references
parallel algorithm
0 references
single-source shortest path problem
0 references
weighted digraph
0 references
processor bounds
0 references
