Applications of matching and edge‐coloring algorithms to routing in clos networks (Q4313624): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230240603 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2027472000 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5513488 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A fast parallel algorithm for routing in permutation networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a Class of Rearrangeable Switching Networks Part I: Control Algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5528475 / rank | |||
Normal rank | |||
Latest revision as of 09:36, 23 May 2024
scientific article; zbMATH DE number 695991
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Applications of matching and edge‐coloring algorithms to routing in clos networks |
scientific article; zbMATH DE number 695991 |
Statements
Applications of matching and edge‐coloring algorithms to routing in clos networks (English)
0 references
27 November 1994
0 references
rearrangeable Clos networks
0 references
telephone switching
0 references
matching
0 references
edge- coloring
0 references
bipartite graphs
0 references
