{"title":"网络的容量因子","authors":"Haibin Kan, Xin Wang","doi":"10.1109/ICPPW.2007.79","DOIUrl":null,"url":null,"abstract":"In the paper, we first investigate some properties of capacity factors of a point-to-point network, then give a new upper bound for the maximal cardinality of capacity factors, which is better than the bound in [3]. Finally, we give two definitions of the vertex capacity factors, and present a close relation between the vertex capacity factors and the edge capacity factors.","PeriodicalId":367703,"journal":{"name":"2007 International Conference on Parallel Processing Workshops (ICPPW 2007)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"The capacity factors of a network\",\"authors\":\"Haibin Kan, Xin Wang\",\"doi\":\"10.1109/ICPPW.2007.79\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the paper, we first investigate some properties of capacity factors of a point-to-point network, then give a new upper bound for the maximal cardinality of capacity factors, which is better than the bound in [3]. Finally, we give two definitions of the vertex capacity factors, and present a close relation between the vertex capacity factors and the edge capacity factors.\",\"PeriodicalId\":367703,\"journal\":{\"name\":\"2007 International Conference on Parallel Processing Workshops (ICPPW 2007)\",\"volume\":\"88 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-09-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Conference on Parallel Processing Workshops (ICPPW 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPPW.2007.79\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Parallel Processing Workshops (ICPPW 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPPW.2007.79","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In the paper, we first investigate some properties of capacity factors of a point-to-point network, then give a new upper bound for the maximal cardinality of capacity factors, which is better than the bound in [3]. Finally, we give two definitions of the vertex capacity factors, and present a close relation between the vertex capacity factors and the edge capacity factors.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
