最大流问题的一种新算法

19th Annual Symposium on Foundations of Computer Science (sfcs 1978) Pub Date : 1978-10-16 DOI:10.1109/SFCS.1978.5

Z. Galil

{"title":"最大流问题的一种新算法","authors":"Z. Galil","doi":"10.1109/SFCS.1978.5","DOIUrl":null,"url":null,"abstract":"A new algorithm for finding the maximal flow in a given network is presented. The algorithm runs in time O(V5/3E2/3) or O(n2.33) where n = V + E is the length of the input.","PeriodicalId":346837,"journal":{"name":"19th Annual Symposium on Foundations of Computer Science (sfcs 1978)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1978-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"28","resultStr":"{\"title\":\"A new algorithm for the maximal flow problem\",\"authors\":\"Z. Galil\",\"doi\":\"10.1109/SFCS.1978.5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new algorithm for finding the maximal flow in a given network is presented. The algorithm runs in time O(V5/3E2/3) or O(n2.33) where n = V + E is the length of the input.\",\"PeriodicalId\":346837,\"journal\":{\"name\":\"19th Annual Symposium on Foundations of Computer Science (sfcs 1978)\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1978-10-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"28\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"19th Annual Symposium on Foundations of Computer Science (sfcs 1978)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SFCS.1978.5\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"19th Annual Symposium on Foundations of Computer Science (sfcs 1978)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.1978.5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 28

摘要

提出了一种求给定网络中最大流量的新算法。算法运行时间为O(V5/3E2/3)或O(n2.33)，其中n = V + E是输入的长度。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A new algorithm for the maximal flow problem

A new algorithm for finding the maximal flow in a given network is presented. The algorithm runs in time O(V5/3E2/3) or O(n2.33) where n = V + E is the length of the input.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

19th Annual Symposium on Foundations of Computer Science (sfcs 1978)

自引率

0.00%

发文量