A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees (Q4360134)
From MaRDI portal
(Redirected from Item:Q4645917)
 | 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: A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees |
scientific article; zbMATH DE number 7000343
- A network-flow technique for finding low-weight bounded-degree spanning trees
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees |
scientific article; zbMATH DE number 7000343 |
|
Statements
A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees (English)
0 references
A network-flow technique for finding low-weight bounded-degree spanning trees (English)
0 references
20 September 1998
0 references
11 January 2019
0 references
low-weight spanning tree
0 references
span tree
0 references
minimum span tree
0 references
edge weight
0 references
performance guarantee
0 references
positive flow
0 references
0 references
0.9971599578857422
0 references
0.869877278804779
0 references
