Steiner problem in Halin networks (Q1092013): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0166-218x(87)90031-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2090373017 / rank | |||
Normal rank | |||
Latest revision as of 08:24, 30 July 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
