On complexity of subset interconnection designs (Q1804586): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
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 | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf01096768 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1969940463 / rank | |||
Normal rank |
Latest revision as of 10:58, 30 July 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