{"title":"Network flow and generalized path compression","authors":"Z. Galil, A. Naamad","doi":"10.1145/800135.804394","DOIUrl":null,"url":null,"abstract":"An O(EVlog2V) algorithm for finding the maximal flow in networks is described. It is asymptotically better than the other known algorithms if E = O(V2-ε) for some ε>0. The analysis of the running time exploits the discovery of a phenomenon similar to (but more general than) path compression, although the union find algorithm is not used. The time bound is shown to be tight in terms of V and E by exhibiting a family of networks that require Ω(EVlog2V) time.++","PeriodicalId":176545,"journal":{"name":"Proceedings of the eleventh annual ACM symposium on Theory of computing","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1979-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"28","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the eleventh annual ACM symposium on Theory of computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800135.804394","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 28
Abstract
An O(EVlog2V) algorithm for finding the maximal flow in networks is described. It is asymptotically better than the other known algorithms if E = O(V2-ε) for some ε>0. The analysis of the running time exploits the discovery of a phenomenon similar to (but more general than) path compression, although the union find algorithm is not used. The time bound is shown to be tight in terms of V and E by exhibiting a family of networks that require Ω(EVlog2V) time.++
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
