An O(V 5/3 E 2/3) algorithm for the maximal flow problem-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

An O(V 5/3 E 2/3) algorithm for the maximal flow problem

Published:1980-09 Issue:3 Volume:14 Page:221-242
ISSN:0001-5903
Container-title:Acta Informatica
language:en
Short-container-title:Acta Informatica

Author:

Galil Zvi

Publisher

Springer Science and Business Media LLC

Subject

Computer Networks and Communications,Information Systems,Software

Link

http://link.springer.com/content/pdf/10.1007/BF00264254.pdf

Reference13 articles.

1. Adelson-Velsky GM, Dinic EA, Karzanov AV (1975) Flow algorithms, (in Russian). Nauka, Moscow

2. Aho AV, Hopcroft JE, Ullman JD (1974) The design and analysis of computer algorithms. Reading, Mass Addison-Wesley

3. Cherkasky BV (1977) Algorithm of construction of maximal flow in networks with complexity of O(V √ E) operations (in Russian). Mathematical Methods of Solution of Economical Problems 7: 117–125

4. Dinic EA (1970) Algorithm for solution of a problem of maximal flow in a network with power estimation. Soviet Math Dokl 11: 1277–1280

5. Edmonds J, Karp RM (1972) Theoretical improvement in algorithmic efficiency for network flow problems. JCAM 19: 248–264

Cited by 38 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A survey on exact algorithms for the maximum flow and minimum‐cost flow problems;Networks;2023-06-20

2. Netzwerkflüsse;Kombinatorische Optimierung;2018

3. Network Flows;Algorithms and Combinatorics;2018

4. Netzwerkflüsse;Kombinatorische Optimierung;2012

5. Network Flows;Algorithms and Combinatorics;2011-10-27

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP