A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees (Q4360134)

From MaRDI portal
Revision as of 19:56, 17 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
  • A network-flow technique for finding low-weight bounded-degree spanning trees

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
0 references
0 references
0 references
0 references
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

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references