Generalized Steiner problem in outerplanar networks (Q1074505): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 04:06, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generalized Steiner problem in outerplanar networks |
scientific article |
Statements
Generalized Steiner problem in outerplanar networks (English)
0 references
1985
0 references
The generalized Steiner problem in a network is considered. The generalization consists in the requirement that some vertices satisfy certain pairwise (vertex or edge) connectivity constraints. The general problem was known to be NP-complete, but for the case when the underlying network is outerplanar and the subnetwork is required to be biconnected (or edge biconnected), a linear time algorithm is presented.
0 references
outerplanar network
0 references
generalized Steiner problem
0 references
connectivity constraints
0 references
linear time algorithm
0 references
