Finding the k most vital edges in the minimum spanning tree problem (Q1127438)
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 1189713
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding the k most vital edges in the minimum spanning tree problem |
scientific article; zbMATH DE number 1189713 |
Statements
Finding the k most vital edges in the minimum spanning tree problem (English)
0 references
13 August 1998
0 references
combinatorial algorithms
0 references
minimum spanning trees
0 references
most vital edges
0 references
NC algorithms
0 references
network optimization
0 references
0.9506638646125792
0 references
0.9334900379180908
0 references
0.9165019989013672
0 references
