Pages that link to "Item:Q2583551"
From MaRDI portal
The following pages link to Application of the special Latin square to a parallel routing algorithm on a recursive circulant network. (Q2583551):
Displaying 5 items.
- Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements (Q638530) (← links)
- On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\) (Q1019176) (← links)
- A parallel routing algorithm on circulant networks employing the Hamiltonian circuit Latin square (Q2509233) (← links)
- CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2<sup>m</sup>, 2) (Q5187853) (← links)
- Computational and Information Science (Q5491603) (← links)
