Minimum Flows in Directed 1−n Planar Static and Dynamic Networks with Arcs and Nodes Capacities

Planar networks are an important special class of networks that arise in several application contexts. Because of the special structure of planar networks, network flow algorithms often run faster on these networks than they do on more general networks. In first part (Secs. 2–5), we present an algor...

Full description

Saved in:
Bibliographic Details
Published inJournal of circuits, systems, and computers Vol. 31; no. 7
Main Authors Ciurea, Eleonor, Georgescu, Oana, Schiopu, Camelia
Format Journal Article
LanguageEnglish
Published Singapore World Scientific Publishing Company 15.05.2022
World Scientific Publishing Co. Pte., Ltd
Subjects
Algorithms
Minimum flow
Networks
Nodes
minimum flow problem
Network flow
network algorithms
planar graphs
Online AccessGet full text
ISSN0218-1266
1793-6454
DOI10.1142/S0218126622300045

Cover

More Information
Summary:Planar networks are an important special class of networks that arise in several application contexts. Because of the special structure of planar networks, network flow algorithms often run faster on these networks than they do on more general networks. In first part (Secs. 2–5), we present an algorithm for finding maximum cut and an algorithm for finding minimum flow in directed 1 − n planar static networks with arcs and nodes capacities. This part is presented in Ciurea et al. [Proc. 5th Int. Conf. Control Decision and Information Technologies (CoDIT2018), Thessaloniki, Greece (2018), pp. 110–115]. In the second part (Secs. 6–8), we present this problem in directed 1 − n planar dynamic networks with arcs and nodes capacities.
Bibliography:This paper was recommended by Regional Editor Piero Malcovati.
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0218-1266
1793-6454
DOI:10.1142/S0218126622300045