Pages that link to "Item:Q1364475"
From MaRDI portal
The following pages link to Multiplicative circulant networks. Topological properties and communication algorithms (Q1364475):
Displaying 26 items.
- A family of efficient six-regular circulants representable as a Kronecker product (Q260026) (← links)
- Multiswapped networks and their topological and algorithmic properties (Q394739) (← links)
- Improved upper bounds for vertex and edge fault diameters of Cartesian graph bundles (Q479023) (← links)
- Fault-diameter of Cartesian graph bundles (Q845824) (← links)
- Forwarding and optical indices of 4-regular circulant networks (Q891819) (← links)
- Wide diameter of Cartesian graph bundles (Q973142) (← links)
- On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\) (Q1019176) (← links)
- The edge fault-diameter of Cartesian graph bundles (Q1024302) (← links)
- Maximum induced subgraph of a recursive circulant (Q1041770) (← links)
- Stirling networks: A versatile combinatorial topology for multiprocessor systems (Q1199419) (← links)
- Recursive circulants and their embeddings among hypercubes (Q1575703) (← links)
- The explicit identities for spectral norms of circulant-type matrices involving binomial coefficients and harmonic numbers (Q1718584) (← links)
- A survey on multi-loop networks. (Q1874388) (← links)
- Using semidirect products of groups to build classes of interconnection networks (Q2192066) (← links)
- Cube-connected circulants: bisection width, Wiener and forwarding indices (Q2283106) (← links)
- Mixed fault diameter of Cartesian graph bundles (Q2446299) (← links)
- The fault-diameter of Cartesian products (Q2474266) (← links)
- A survey on undirected circulant graphs (Q2905302) (← links)
- Hypercomplete: A pancyclic recursive topology for large-scale distributed multicomputer systems (Q4944742) (← links)
- (Q5068490) (← links)
- (Q5150427) (← links)
- (Q5150591) (← links)
- NEW FAMILIES OF MULTIPLICATIVE CIRCULANT NETWORKS (Q5151234) (← links)
- CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2<sup>m</sup>, 2) (Q5187853) (← links)
- Message passing on networks with loops (Q5218487) (← links)
- A method for automatic search for families of optimal chordal ring networks (Q6648345) (← links)
