Hypercomplete: A pancyclic recursive topology for large-scale distributed multicomputer systems
From MaRDI portal
Publication:4944742
DOI<56::AID-NET5>3.0.CO;2-D 10.1002/(SICI)1097-0037(200001)35:1<56::AID-NET5>3.0.CO;2-DzbMath0938.90066OpenAlexW1992073055MaRDI QIDQ4944742
Jywe-Fei Fang, Gen-Huey Chen, Jung-Sheng Fu
Publication date: 27 June 2000
Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(200001)35:1<56::aid-net5>3.0.co;2-d
shortest pathembeddingdiameterspanning treeHamiltonian-connectedbroadcasting algorithminterconnection topologyascend/descend algorithmshypercompletelarge-scale distributed multicomputer systemspancyclic recursive topology
Programming involving graphs or networks (90C35) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Vertex-bipancyclicity of the generalized honeycomb tori ⋮ Node-disjoint paths in a level block of generalized hierarchical completely connected networks ⋮ Edge-fault-tolerant vertex-pancyclicity of augmented cubes ⋮ On vertex-pancyclicity and edge-pancyclicity of the WK-recursive network ⋮ The Hamiltonian connectivity of rectangular supergrid graphs ⋮ Conditional fault Hamiltonicity of the complete graph ⋮ On embedding cycles into faulty twisted cubes ⋮ Vertex-pancyclicity of augmented cubes with maximal faulty edges ⋮ Edge-pancyclicity of recursive circulants ⋮ Survey on path and cycle embedding in some networks
Cites Work
