关于互连网络线性多故障的一个注记

E. Cheng, László Lipták, K. Qiu, Z. Shen
{"title":"关于互连网络线性多故障的一个注记","authors":"E. Cheng, László Lipták, K. Qiu, Z. Shen","doi":"10.1142/s0219265921420172","DOIUrl":null,"url":null,"abstract":"Connectivity type measures form an important part of network analysis, in particular, in analyzing vulnerability and resiliency of interconnection networks. One such measure is to consider the structure of the resulting graph when “many” vertices are deleted. In this short note, we study a way to extend some known results on this topic.","PeriodicalId":153590,"journal":{"name":"J. Interconnect. Networks","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Note on Linearly Many Faults of Interconnection Networks\",\"authors\":\"E. Cheng, László Lipták, K. Qiu, Z. Shen\",\"doi\":\"10.1142/s0219265921420172\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Connectivity type measures form an important part of network analysis, in particular, in analyzing vulnerability and resiliency of interconnection networks. One such measure is to consider the structure of the resulting graph when “many” vertices are deleted. In this short note, we study a way to extend some known results on this topic.\",\"PeriodicalId\":153590,\"journal\":{\"name\":\"J. Interconnect. Networks\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-01-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"J. Interconnect. Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/s0219265921420172\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"J. Interconnect. Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s0219265921420172","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

连通性度量是网络分析的重要组成部分,特别是在分析互联网络的脆弱性和弹性方面。其中一种方法是在删除“许多”顶点时考虑生成图的结构。在这篇简短的文章中,我们研究了一种扩展关于这个主题的一些已知结果的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Note on Linearly Many Faults of Interconnection Networks
Connectivity type measures form an important part of network analysis, in particular, in analyzing vulnerability and resiliency of interconnection networks. One such measure is to consider the structure of the resulting graph when “many” vertices are deleted. In this short note, we study a way to extend some known results on this topic.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信