Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree<sup>∗</sup> (Q4511611)
From MaRDI portal
scientific article; zbMATH DE number 1523617
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree<sup>∗</sup> |
scientific article; zbMATH DE number 1523617 |
Statements
Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree<sup>∗</sup> (English)
0 references
30 October 2000
0 references
fast parallel algorithm
0 references
0 references
