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

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Merged Item from Q4645917
aliases / en / 0aliases / en / 0
 
A network-flow technique for finding low-weight bounded-degree spanning trees
description / endescription / en
 
scientific article; zbMATH DE number 7000343
Property / title
 
A network-flow technique for finding low-weight bounded-degree spanning trees (English)
Property / title: A network-flow technique for finding low-weight bounded-degree spanning trees (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1415.90099 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/3-540-61310-2_9 / rank
 
Normal rank
Property / published in
 
Property / published in: Integer Programming and Combinatorial Optimization / rank
 
Normal rank
Property / publication date
 
11 January 2019
Timestamp+2019-01-11T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 11 January 2019 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 7000343 / rank
 
Normal rank
Property / zbMATH Keywords
 
span tree
Property / zbMATH Keywords: span tree / rank
 
Normal rank
Property / zbMATH Keywords
 
minimum span tree
Property / zbMATH Keywords: minimum span tree / rank
 
Normal rank
Property / zbMATH Keywords
 
edge weight
Property / zbMATH Keywords: edge weight / rank
 
Normal rank
Property / zbMATH Keywords
 
performance guarantee
Property / zbMATH Keywords: performance guarantee / rank
 
Normal rank
Property / zbMATH Keywords
 
positive flow
Property / zbMATH Keywords: positive flow / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1930167353 / rank
 
Normal rank

Revision as of 09:17, 6 May 2024

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