Two algorithms for the subset interconnection design problem (Q4018996): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1002/net.3230220406 / rank | |||
| Property / cites work | |||
| Property / cites work: Q3804742 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/NET.3230220406 / rank | |||
Normal rank | |||
Latest revision as of 00:14, 29 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two algorithms for the subset interconnection design problem |
scientific article |
Statements
Two algorithms for the subset interconnection design problem (English)
0 references
16 January 1993
0 references
NP-complete generalization
0 references
minimum spanning tree
0 references
minimum subset interconnection design
0 references
