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 this page instead for the normal view: Parallel algorithm for finding the most vital edge in weighted graphs |
scientific article; zbMATH DE number 1140533
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
