The degree-constrained and diameter-constrained minimum spanning tree problem and its algorithm (Q4926072)
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: The degree-constrained and diameter-constrained minimum spanning tree problem and its algorithm |
scientific article; zbMATH DE number 6178406
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The degree-constrained and diameter-constrained minimum spanning tree problem and its algorithm |
scientific article; zbMATH DE number 6178406 |
Statements
20 June 2013
0 references
minimum spanning tree
0 references
heuristic algorithm
0 references
degree-constrained
0 references
diameter-constrained
0 references
0.8476120233535767
0 references
0.8433382511138916
0 references
0.836106538772583
0 references
0.8307348489761353
0 references
