The Complexity of Computing Steiner Minimal Trees (Q4182533): Difference between revisions
From MaRDI portal
Changed an Item |
Created claim: Wikidata QID (P12): Q105723921, #quickstatements; #temporary_batch_1711504539957 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0132072 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2060380213 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q105723921 / rank | |||
Normal rank | |||
Latest revision as of 03:52, 27 March 2024
scientific article; zbMATH DE number 3619923
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Complexity of Computing Steiner Minimal Trees |
scientific article; zbMATH DE number 3619923 |
Statements
The Complexity of Computing Steiner Minimal Trees (English)
0 references
1977
0 references
Computing Steiner Minimal Trees
0 references
Complexity
0 references
