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 this page instead for the normal view: Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals |
scientific article; zbMATH DE number 6189833
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
