THE CONGESTION OF GENERALIZED CUBE COMMUNICATION PATTERN IN LINEAR ARRAY NETWORK
From MaRDI portal
Publication:2929617
DOI10.1142/S0129054114500130zbMath1302.68033OpenAlexW1973303256MaRDI QIDQ2929617
Li He, Cui Yu, Xiaofan Yang, Jing Zhang
Publication date: 14 November 2014
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054114500130
Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (2)
Routing and wavelength assignment for exchanged crossed cubes on ring-topology optical networks ⋮ Realizing Exchanged Crossed Cube Communication Patterns on Linear Array WDM Optical Networks
Cites Work
- \(\{2,3\}\)-extraconnectivities of hypercube-like networks
- Fault-tolerant cycle embedding in the hypercube
- Routing and wavelength assignment for 3-ary \(n\)-cube in array-based optical network
- A fast fault-identification algorithm for bijective connection graphs using the PMC model
- Efficient unicast in bijective connection networks with the restricted faulty node set
- Embedding of cycles in twisted cubes with edge-pancyclic
- A note about some properties of BC graphs
- Maximum number of edges joining vertices on a cube
- Maximum induced subgraph of a recursive circulant
- Spanning tree congestion of the hypercube
- Hamilton-connectivity and cycle-embedding of the Möbius cubes
- A fast pessimistic one-step diagnosis algorithm for hypercube multicomputer systems
- The spanning laceability on the faulty bipartite hypercube-like networks
- Edge-pancyclicity and path-embeddability of bijective connection graphs
- A (4n − 9)/3 diagnosis algorithm for generalised cube networks
- The locally twisted cubes
This page was built for publication: THE CONGESTION OF GENERALIZED CUBE COMMUNICATION PATTERN IN LINEAR ARRAY NETWORK
