Fast, Efficient Parallel Algorithms for Some Graph Problems (Q3932299): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:08, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast, Efficient Parallel Algorithms for Some Graph Problems |
scientific article |
Statements
Fast, Efficient Parallel Algorithms for Some Graph Problems (English)
0 references
1981
0 references
graph algorithm
0 references
minimum spanning tree
0 references
biconnected component
0 references
bridge
0 references
fundamental cycle
0 references
multiprocessing
0 references
