欢迎您!
东篱公司
退出
申报数据库
申报指南
立项数据库
成果数据库
期刊论文
会议论文
著 作
专 利
项目获奖数据库
位置:
成果数据库
>
期刊
> 期刊详情页
Conditional Diagnosability of Matching Composition Networks Under the PMC Model
ISSN号:1549-7747
期刊名称:IEEE Transactions on Circuits and Systems II-Expre
时间:0
页码:875-879
语言:英文
相关项目:网络优化设计中的算法博弈研究
作者:
Thulasiraman, Krishnaiyan|Hu, Xiao-Dong|Xu, Min|
同期刊论文项目
网络优化设计中的算法博弈研究
期刊论文 25
会议论文 2
同项目期刊论文
Packing cycles exactly in polynomial time
A unified approach to box-Mengerian hypergraphs
Improved Algorithm for minimum data aggregation time problem in wireless sensor networks
Approximation algorithms for soft-capacitated facility location in capacitated network design
The box-TDI system associated with 2-edge connected spanning subgraphs
Cost-effective designs of fault-tolerant access networks in communication systems
A polynomial solvable minimum risk spanning tree problem with interval data
Data gathering schedule for minimal aggregation time in wireless sensor networks
The conditional diagnosability of shuffle-cubes
带区间数据的最小风险斯坦纳树问题
Inapproximability and approximability of minimal tree routing and coloring
A characterization of box-Mengerian matroid ports
Identifying codes of cycles with odd orders