Maximal Flow Through a Network-Reference-Cited by-同舟云学术

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

Maximal Flow Through a Network

Published:2009 Issue: Volume: Page:243-248
ISSN:
Container-title:Classic Papers in Combinatorics
language:
Short-container-title:

Author:

Ford L. R.,Fulkerson D. R.

Publisher

Birkhäuser Boston

Link

http://link.springer.com/content/pdf/10.1007/978-0-8176-4842-8_15

Reference3 articles.

1. G. B. Dantzig, Maximization of a linear function of variables subject to linear inequalities: Activity analysis of production and allocation(Cowles Commission, 1951).

2. H. Whitney, Non-separable and planar graphs, Trans. Amer. Math. Soc, 34(1932), 339-362.

3. H. Whitney, Planar graphs,Fundamenta Mathematicae, 21(1933), 73-84.

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

1. Optimization on land development intensity of new industrial towns based on carrying capacity of multi-modal traffic network;Transportation Planning and Technology;2024-05-02

2. Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

3. Network Aware Forecasting for eCommerce Supply Planning;Proceedings of the 31st ACM International Conference on Information & Knowledge Management;2022-10-17

4. Distribution equality as an optimal epidemic mitigation strategy;Scientific Reports;2022-06-21

5. A Lightweight Optimal Scheduling Algorithm for Energy-Efficient and Real-Time Cloud Services;IEEE Access;2022

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP