更快的2-不相交最短路径算法

{"title":"更快的2-不相交最短路径算法","authors":"M. Akhmedov","doi":"10.1007/978-3-030-50026-9_7","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":319321,"journal":{"name":"Computer Science Symposium in Russia","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Faster 2-Disjoint-Shortest-Paths Algorithm\",\"authors\":\"M. Akhmedov\",\"doi\":\"10.1007/978-3-030-50026-9_7\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":319321,\"journal\":{\"name\":\"Computer Science Symposium in Russia\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-06-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Science Symposium in Russia\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-030-50026-9_7\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Science Symposium in Russia","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-030-50026-9_7","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}