Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals (Q2840557)
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 6189833
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals |
scientific article; zbMATH DE number 6189833 |
Statements
Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals (English)
0 references
19 July 2013
0 references
Steiner tree
0 references
Steiner convexity
0 references
enumerative combinatorics
0 references
strong Steiner interval
0 references
0.8548700213432312
0 references
0.7626238465309143
0 references
0.7530308365821838
0 references
0.7442086935043335
0 references
0.7371888160705566
0 references
