Parallel algorithms for finding the most vital edge with respect to minimum spanning tree (Q1201944)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Parallel algorithms for finding the most vital edge with respect to minimum spanning tree |
scientific article; zbMATH DE number 98851
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel algorithms for finding the most vital edge with respect to minimum spanning tree |
scientific article; zbMATH DE number 98851 |
Statements
Parallel algorithms for finding the most vital edge with respect to minimum spanning tree (English)
0 references
17 January 1993
0 references
vital edge
0 references
minimum spanning tree
0 references
cost-optimal parallel algorithms
0 references
weighted graph
0 references
0.9823645
0 references
0.9382392
0 references
0.93349576
0 references
0.92220896
0 references
0.92027074
0 references
0.9194295
0 references
0 references
