Two algorithms for the subset interconnection design problem (Q4018996): 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.1002/net.3230220406 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1981890243 / rank | |||
Normal rank | |||
Revision as of 23:52, 19 March 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
