Dual of a complete graph as an interconnection network (Q1581285): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1006/jpdc.2000.1640 / rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: RCC-FULL / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2149466643 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1006/JPDC.2000.1640 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 05:41, 28 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Dual of a complete graph as an interconnection network |
scientific article |
Statements
Dual of a complete graph as an interconnection network (English)
0 references
13 June 2001
0 references
interconnection network
0 references
hypernetworks
0 references