具有圆弧和节点容量的有向s-t平面网络中的最小流

2018 5th International Conference on Control, Decision and Information Technologies (CoDIT) Pub Date : 2018-04-10 DOI:10.1109/CoDIT.2018.8394790

E. Ciurea, Oana Georgescu, Camelia Schiopu

{"title":"具有圆弧和节点容量的有向s-t平面网络中的最小流","authors":"E. Ciurea, Oana Georgescu, Camelia Schiopu","doi":"10.1109/CoDIT.2018.8394790","DOIUrl":null,"url":null,"abstract":"We present an algorithm for finding maximum cut and an algorithm for finding minimum flow in directed s-t planar networks with arcs and nodes capacities. As a final part, we present an example for these two algorithms.","PeriodicalId":128011,"journal":{"name":"2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Minimum flows in directed s-t planar networks with arcs and nodes capacities\",\"authors\":\"E. Ciurea, Oana Georgescu, Camelia Schiopu\",\"doi\":\"10.1109/CoDIT.2018.8394790\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present an algorithm for finding maximum cut and an algorithm for finding minimum flow in directed s-t planar networks with arcs and nodes capacities. As a final part, we present an example for these two algorithms.\",\"PeriodicalId\":128011,\"journal\":{\"name\":\"2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)\",\"volume\":\"71 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-04-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CoDIT.2018.8394790\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CoDIT.2018.8394790","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

我们提出了一种寻找最大切割的算法和一种寻找具有圆弧和节点容量的有向s-t平面网络中最小流量的算法。最后，我们给出了这两种算法的一个例子。

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

查看原文本刊更多论文

Minimum flows in directed s-t planar networks with arcs and nodes capacities

We present an algorithm for finding maximum cut and an algorithm for finding minimum flow in directed s-t planar networks with arcs and nodes capacities. As a final part, we present an example for these two algorithms.

求助全文

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

来源期刊

2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)

自引率

0.00%

发文量