A GENERIC PREFLOW ALGORITHM FOR MAXIMUM FLOW IN SEMI-BIPARTITE NETWORKS

In this article, the authors have developed a generic algorithm for determining a maximum flow in a semi-bipartite network. This algorithm allows only nodes in N^sub 1^ to be active. For this reason, it performs pushes on individual arcs having both endpoints in N^sub 1^ or admissible paths of lengt...

Full description

Saved in:
Bibliographic Details
Published inBulletin of the Transilvania University of Brașov. Series III, Mathematics, informatics, physics Vol. 7; no. 1; p. 103
Main Author Ciupala, Laura
Format Journal Article
LanguageEnglish
Published Brasov Transilvania University of Brasov 01.01.2014
Subjects
Algorithms
Mathematical analysis
Networks
Running
Online AccessGet full text
ISSN2065-2151

Cover

More Information
Summary:In this article, the authors have developed a generic algorithm for determining a maximum flow in a semi-bipartite network. This algorithm allows only nodes in N^sub 1^ to be active. For this reason, it performs pushes on individual arcs having both endpoints in N^sub 1^ or admissible paths of length 2 whose starting and ending nodes are both contained in N^sub 1^. The running time of this algorithm is O(...).
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:2065-2151