Steiner problem in Halin networks (Q1092013): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:10, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Steiner problem in Halin networks |
scientific article |
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
