On complexity of subset interconnection designs (Q1804586): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An optimization problem on graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Matroids and Subset Interconnection Design / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3984073 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the complexity of an optimal routing tree problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some simplified NP-complete graph problems / rank | |||
Normal rank | |||
Revision as of 14:27, 23 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On complexity of subset interconnection designs |
scientific article |
Statements
On complexity of subset interconnection designs (English)
0 references
15 May 1995
0 references
subset interconnection designs
0 references
