The computation of nearly minimal Steiner trees in graphs (Q4750659): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/0020739830140103 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2082150701 / rank | |||
Normal rank | |||
Revision as of 01:38, 20 March 2024
scientific article; zbMATH DE number 3807631
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The computation of nearly minimal Steiner trees in graphs |
scientific article; zbMATH DE number 3807631 |
Statements
The computation of nearly minimal Steiner trees in graphs (English)
0 references
1983
0 references
