Parallel algorithm for finding the most vital edge in weighted graphs (Q1384523)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1140533
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel algorithm for finding the most vital edge in weighted graphs |
scientific article; zbMATH DE number 1140533 |
Statements
Parallel algorithm for finding the most vital edge in weighted graphs (English)
0 references
1 October 1998
0 references
weighted undirected graph
0 references
0.9457319378852844
0 references
0.9240717887878418
0 references
0.872758686542511
0 references
0.8695524334907532
0 references
