一种O(n3loglog / log2n)时间的全对最短路径算法

{"title":"一种O(n3loglog / log2n)时间的全对最短路径算法","authors":"Yijie Han, T. Takaoka","doi":"10.1007/978-3-642-31155-0_12","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":447445,"journal":{"name":"Scandinavian Workshop on Algorithm Theory","volume":"1856 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"27","resultStr":"{\"title\":\"An O(n 3 loglogn/log2 n) Time Algorithm for All Pairs Shortest Paths\",\"authors\":\"Yijie Han, T. Takaoka\",\"doi\":\"10.1007/978-3-642-31155-0_12\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":447445,\"journal\":{\"name\":\"Scandinavian Workshop on Algorithm Theory\",\"volume\":\"1856 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-07-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"27\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Scandinavian Workshop on Algorithm Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/978-3-642-31155-0_12\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Scandinavian Workshop on Algorithm Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/978-3-642-31155-0_12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}