位置：成果数据库 > 会议 > 会议详情页
An Algorithm to Find Optimal Independent Spanning Trees on Twisted-cubes
  • 所属机构名称：苏州大学
  • 会议名称：The 4th International Symposiumon Parallel Architectures, Algorithms and Programming(PAAP)
  • 成果类型：会议
  • 会场：Tianjin
  • 相关项目：BC图多处理器网络类中基于限制故障集条件下的可靠单播和广播研究
作者： Han, Yuejuan|Fan, Jianxi|Wang, Yan|
同会议论文项目
BC图多处理器网络类中基于限制故障集条件下的可靠单播和广播研究
期刊论文 31 会议论文 11
同项目会议论文
Broadcast in bijective connection networks with the restricted faulty node set
An algorithm to construct independent spanning trees on crossed cubes
Abstraction Framework and Complexity of Model Checking Based on the Promela Models
Efficient Algorithms to Embed Hamiltonian Paths and Cycles in Faulty Crossed Cubes
Construction of independent spanning trees on twisted-cubes
On reliable unicast and broadcast in bijective connection networks with the restricted node/edge fau
The Restricted Connectivity of Locally Twisted Cubes
A fault-free unicast algorithm in twisted cubes with the restricted faulty node set
Interconnection Networks with Path Selection (Keynote Speech)
TAP: An Adjustable Planar Structure for Adaptive Topology Control in Wireless Ad Hoc Networks