On the complexity of circulations-Reference-Cited by-同舟云学术

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

On the complexity of circulations

Published:1986-03 Issue:1 Volume:7 Page:134-145
ISSN:0196-6774
Container-title:Journal of Algorithms
language:en
Short-container-title:Journal of Algorithms

Author:

Arkin Esther M,Papadimitriou Christos H

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computational Mathematics,Control and Optimization

Reference12 articles.

1. Matching, Euler tours, and the Chinese postman;Edmonds;Math. Programming,1973

2. Computers and Intractability: A Guide to the Theory of NP-completeness;Garey,1979

3. Some recent applications of theory of linear inequalities to extremal combinatorial analysis;Hoffman,1960

4. Determining the max-flow in network with the method of pre-flows;Karzanov;Soviet Math. Dokl.,1974

5. A polynomial algorithm for linear programming;Khachian;Dokl. Akad. Nauk. SSSR,1979

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

1. Finding all multi-state minimal paths of a multi-state flow network via feasible circulations;Reliability Engineering & System Safety;2020-12

2. Circulations;Graphs, Networks and Algorithms;2013

3. On the Circuit Cover Problem for Mixed Graphs;Combinatorics, Probability and Computing;2002-01

4. Circuit covers in series-parallel mixed graphs;LATIN'98: Theoretical Informatics;1998

5. Graph Algorithms;Algorithms and Complexity;1990

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP