二部动态网络中的最大流量

Q4 Mathematics

Bulletin of the Transilvania University of Brasov, Series III: Mathematics, Informatics, Physics Pub Date : 2019-07-20 DOI:10.31926/but.mif.2019.12.61.1.14

Camelia Schiopu, Romania Brasov

{"title":"二部动态网络中的最大流量","authors":"Camelia Schiopu, Romania Brasov","doi":"10.31926/but.mif.2019.12.61.1.14","DOIUrl":null,"url":null,"abstract":"In this paper we study maximum flow algorithms for stationary bipartite dynamic networks. In a bipartite static network the several maximum flow algorithms can be substantially improved. The basic idea in this improvement is a two arcs push rule. This idea is also extended to minimum cost flow. In the end of the paper we present an example. 2000 Mathematics Subject Classification: 0B10, 90C35, 05C35, 68R10.","PeriodicalId":38784,"journal":{"name":"Bulletin of the Transilvania University of Brasov, Series III: Mathematics, Informatics, Physics","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2019-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Maximum flows in bipartite dynamic networks\",\"authors\":\"Camelia Schiopu, Romania Brasov\",\"doi\":\"10.31926/but.mif.2019.12.61.1.14\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we study maximum flow algorithms for stationary bipartite dynamic networks. In a bipartite static network the several maximum flow algorithms can be substantially improved. The basic idea in this improvement is a two arcs push rule. This idea is also extended to minimum cost flow. In the end of the paper we present an example. 2000 Mathematics Subject Classification: 0B10, 90C35, 05C35, 68R10.\",\"PeriodicalId\":38784,\"journal\":{\"name\":\"Bulletin of the Transilvania University of Brasov, Series III: Mathematics, Informatics, Physics\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-07-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Bulletin of the Transilvania University of Brasov, Series III: Mathematics, Informatics, Physics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.31926/but.mif.2019.12.61.1.14\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bulletin of the Transilvania University of Brasov, Series III: Mathematics, Informatics, Physics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.31926/but.mif.2019.12.61.1.14","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Mathematics","Score":null,"Total":0}

引用次数: 4

摘要

本文研究了平稳二分动态网络的最大流算法。在二分静态网络中，几种最大流量算法可以得到显著改进。这个改进的基本思想是一个双圆弧推送规则。这个想法也被扩展到最小成本流。在论文的最后，我们给出了一个例子。2000年数学学科分类：0B10、90C35、05C35、68R10。

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

查看原文本刊更多论文

Maximum flows in bipartite dynamic networks

In this paper we study maximum flow algorithms for stationary bipartite dynamic networks. In a bipartite static network the several maximum flow algorithms can be substantially improved. The basic idea in this improvement is a two arcs push rule. This idea is also extended to minimum cost flow. In the end of the paper we present an example. 2000 Mathematics Subject Classification: 0B10, 90C35, 05C35, 68R10.

求助全文

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

来源期刊

Bulletin of the Transilvania University of Brasov, Series III: Mathematics, Informatics, Physics Mathematics-Mathematics (all)

CiteScore

0.30

自引率

0.00%

发文量