Steiner problem in Halin networks (Q1092013)
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 4012501
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Steiner problem in Halin networks |
scientific article; zbMATH DE number 4012501 |
Statements
Steiner problem in Halin networks (English)
0 references
1987
0 references
A Halin network is obtained from a planar embedding of a tree T with no vertices of degree 2 by adding new edges to join the consecutive leaves of T to form a cycle. The author gives a linear time algorithm for the Steiner problem in Halin networks.
0 references
optimization
0 references
Halin network
0 references
linear time algorithm
0 references
Steiner problem
0 references
0.841838002204895
0 references
0.803887665271759
0 references
0.7990484833717346
0 references
