The congestion of generalized cube communication pattern in linear array network

DOI10.1142/S0129054114500130MaRDI QIDQ2929617zbMATH OpenOpenAlexFDO

Authors Jing Zhang, Xiaofan Yang, Cui Yu, Li He

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

zbMATH Keywords

congestionembeddinggeneralized cubesinduced subgraphlinear array

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Distributed systems (68M14) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Congestion optimale du plongement de l’hypercube H (n) dans la chaîne P(2ⁿ)
• scientific article; zbMATH DE number 1769334
• Embedding hypercubes and related networks into mesh-connected processor arrays
• Optimal embeddings of butterfly-like graphs in the hypercube
• A tight bound for congestion of an embedding

Cites work

• \(\{2,3\}\)-extraconnectivities of hypercube-like networks
• A (4n − 9)/3 diagnosis algorithm for generalised cube networks
• A fast fault-identification algorithm for bijective connection graphs using the PMC model
• A fast pessimistic one-step diagnosis algorithm for hypercube multicomputer systems
• A note about some properties of BC graphs
• Edge-pancyclicity and path-embeddability of bijective connection graphs
• Efficient unicast in bijective connection networks with the restricted faulty node set
• Embedding of cycles in twisted cubes with edge-pancyclic
• Fault-tolerant cycle embedding in the hypercube
• Hamilton-connectivity and cycle-embedding of the Möbius cubes
• Maximum induced subgraph of a recursive circulant
• Maximum number of edges joining vertices on a cube
• Routing and wavelength assignment for 3-ary \(n\)-cube in array-based optical network
• Spanning tree congestion of the hypercube
• The locally twisted cubes
• The spanning laceability on the faulty bipartite hypercube-like networks

Cited in

(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

This page was built for publication: The congestion of generalized cube communication pattern in linear array network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2929617)