{"title":"高效的最大流量算法","authors":"A. Goldberg, R. Tarjan","doi":"10.1145/2628036","DOIUrl":null,"url":null,"abstract":"Though maximum flow algorithms have a long history, revolutionary progress is still being made.","PeriodicalId":10645,"journal":{"name":"Commun. ACM","volume":"10 1","pages":"82-89"},"PeriodicalIF":0.0000,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"115","resultStr":"{\"title\":\"Efficient maximum flow algorithms\",\"authors\":\"A. Goldberg, R. Tarjan\",\"doi\":\"10.1145/2628036\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Though maximum flow algorithms have a long history, revolutionary progress is still being made.\",\"PeriodicalId\":10645,\"journal\":{\"name\":\"Commun. ACM\",\"volume\":\"10 1\",\"pages\":\"82-89\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"115\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Commun. ACM\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2628036\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Commun. ACM","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2628036","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
