NC algorithms for the Single Most Vital Edge problem with respect to shortest paths (Q673229)
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: NC algorithms for the Single Most Vital Edge problem with respect to shortest paths |
scientific article; zbMATH DE number 985455
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | NC algorithms for the Single Most Vital Edge problem with respect to shortest paths |
scientific article; zbMATH DE number 985455 |
Statements
NC algorithms for the Single Most Vital Edge problem with respect to shortest paths (English)
0 references
28 February 1997
0 references
Algorithms
0 references
Parallel processing
0 references
NC algorithms
0 references
0 references
0.8590993285179138
0 references
0.8322994112968445
0 references
0.8251652717590332
0 references
0.8249571323394775
0 references
