{"title":"星型网络中所有最短节点不相交路径的构造","authors":"Cheng-Nan Lai","doi":"10.1016/j.ipl.2015.11.003","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":13545,"journal":{"name":"Inf. Process. Lett.","volume":"40 1","pages":"299-303"},"PeriodicalIF":0.0000,"publicationDate":"2016-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"On the construction of all shortest node-disjoint paths in star networks\",\"authors\":\"Cheng-Nan Lai\",\"doi\":\"10.1016/j.ipl.2015.11.003\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":13545,\"journal\":{\"name\":\"Inf. Process. Lett.\",\"volume\":\"40 1\",\"pages\":\"299-303\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Inf. Process. Lett.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1016/j.ipl.2015.11.003\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Inf. Process. Lett.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1016/j.ipl.2015.11.003","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}