An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems-Reference-Cited by-同舟云学术

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

An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems

Published:2021-11-16 Issue: Volume: Page:
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:Networks

Author:

Curry Robert M.¹^ORCID,Smith J. Cole²^ORCID

Affiliation:

1. Mathematics Department United States Naval Academy Annapolis Maryland USA

2. Department of Electrical Engineering and Computer Science Syracuse University Syracuse New York USA

Funder

Office of Naval Research

Publisher

Wiley

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1002/net.22082

Reference25 articles.

1. A survey on clustering algorithms for wireless sensor networks

2. Some Recent Advances in Network Flows

3. A Fast and Simple Algorithm for the Maximum Flow Problem

4. Equivalence of the primal and dual simplex algorithms for the maximum flow problem

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP