Efficient algorithms for finding the most vital edge of a minimum spanning tree (Q1313724)
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: Efficient algorithms for finding the most vital edge of a minimum spanning tree |
scientific article; zbMATH DE number 500523
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for finding the most vital edge of a minimum spanning tree |
scientific article; zbMATH DE number 500523 |
Statements
Efficient algorithms for finding the most vital edge of a minimum spanning tree (English)
0 references
14 August 2000
0 references
