位置：成果数据库 > 期刊 > 期刊详情页
An algorithm to construct independent spanning trees on parity cubes
  • ISSN号：0304-3975
  • 期刊名称：Theoretical Computer Science
  • 时间：2012
  • 页码：61-72
  • 相关项目：条件BC网络上独立生成树及其性质的研究
作者： Yan Wang|Jianxi Fan|Xiaohua Jia|He Huang|
同期刊论文项目
条件BC网络上独立生成树及其性质的研究
期刊论文 30 会议论文 22
同项目期刊论文
An Efficient Clustering Algorithm in Wireless Sensor Networks Using Cooperative Communication
Parallel construction of independent spanning trees and an application in diagnosis on Mobius cubes
Changing the diameter of the locally twisted cube
基于移动代理的结构化P2P网络模型
Hamiltonian properties of honeycomb meshes
Independent spanning trees in crossed cubes
Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
One-to-one disjoint path covers on alternating group graphs
On the metric dimension of HDN
Embedding complete binary trees into parity cubes
Complete binary trees embeddings in Mobius cubes
Hamiltonian properties of DCell networks
Dimensional-permutation-based independent spanning trees in bijective connection networks
一种能量均衡的最小连通支配集构造算法
Disjoint Paths between Adjacent Vertices in Bijective Connection Networks
基于支配集的多传感器集成复合事件检测
超级局部扭立方体互连网络及其性质
多种资源下结构化P2P网络的负载均衡方法
Key-insulated aggregate signature