An algorithm for the steiner problem in graphs (Q5902589): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230120309 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2115616619 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4083324 / rank | |||
Normal rank | |||
Latest revision as of 09:23, 14 June 2024
scientific article; zbMATH DE number 3811607
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for the steiner problem in graphs |
scientific article; zbMATH DE number 3811607 |
Statements
An algorithm for the steiner problem in graphs (English)
0 references
1982
0 references
Steiner problem
0 references
weighted edges
0 references
branch and bound algorithm
0 references
Steiner graphs
0 references
