A new method for constructing infinite families of \(k\)-tight optimal double loop networks (Q862697): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A very short proof of a conjecture concerning set‐to‐set broadcasting / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A complementary survey on double-loop networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Combinatorial Problem Related to Multimodule Memory Organizations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4499037 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4470839 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An infinite family of 4-tight optimal double loop networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3366923 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Designing of optimal double loop networks / rank | |||
Normal rank |
Latest revision as of 12:56, 25 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A new method for constructing infinite families of \(k\)-tight optimal double loop networks |
scientific article |
Statements
A new method for constructing infinite families of \(k\)-tight optimal double loop networks (English)
0 references
24 January 2007
0 references
interconnection network
0 references
double loop network
0 references
circulant digraph
0 references
diameter
0 references