{"title":"A Method of Forming the Optimal Set of Disjoint Path in Computer Networks","authors":"A. Alnaser","doi":"10.4316/JACSM.201701001","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":30102,"journal":{"name":"Journal of Applied Computer Science Mathematics","volume":"139 1","pages":"9-12"},"PeriodicalIF":0.0000,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Applied Computer Science Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4316/JACSM.201701001","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
