Generalized Steiner problem in outerplanar networks (Q1074505): 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.1007/bf01935369 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2050142375 / rank | |||
Normal rank | |||
Latest revision as of 08:39, 30 July 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
