A new Karzanov-type O(n3) max-flow algorithm

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

A new algorithm is presented for finding maximal and maximum value flows in directed single commodity networks. The algorithm gradually converts a combination of blocking preflows and backflows to a maximal flow in the network. Unlike other maximal flow algorithms, the algorithm treats the network more symmetrically by attempting to increase flow on both the ForwardStep and the BackwardStep. The algorithm belongs to the so called phase algorithms, and is applied to Dinic-type layered networks. With an effort of at most O(n3) for maximum value flow, the algorithm ties with the fastest maximum flow algorithms in dense networks, where m ≈ n2, and can therefore be seen as a significant alternate technique. The algorithm is based on the Karzanov [1] algorithm, and shares features with the algorithm of Tarjan [2]. The first version of this algorithm was presented by the author in [3].

Original languageEnglish (US)
Pages (from-to)65-72
Number of pages8
JournalMathematical and Computer Modelling
Volume16
Issue number2
DOIs
StatePublished - 1992
Externally publishedYes

Fingerprint

Maximum Flow
Tie
Alternate
Convert
Commodities

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Information Systems and Management
  • Control and Systems Engineering
  • Applied Mathematics
  • Computational Mathematics
  • Modeling and Simulation

Cite this

A new Karzanov-type O(n3) max-flow algorithm. / Waissi, Gary.

In: Mathematical and Computer Modelling, Vol. 16, No. 2, 1992, p. 65-72.

Research output: Contribution to journalArticle

@article{1c3ba7881f9a4de2ac738751ae6ad93b,
title = "A new Karzanov-type O(n3) max-flow algorithm",
abstract = "A new algorithm is presented for finding maximal and maximum value flows in directed single commodity networks. The algorithm gradually converts a combination of blocking preflows and backflows to a maximal flow in the network. Unlike other maximal flow algorithms, the algorithm treats the network more symmetrically by attempting to increase flow on both the ForwardStep and the BackwardStep. The algorithm belongs to the so called phase algorithms, and is applied to Dinic-type layered networks. With an effort of at most O(n3) for maximum value flow, the algorithm ties with the fastest maximum flow algorithms in dense networks, where m ≈ n2, and can therefore be seen as a significant alternate technique. The algorithm is based on the Karzanov [1] algorithm, and shares features with the algorithm of Tarjan [2]. The first version of this algorithm was presented by the author in [3].",
author = "Gary Waissi",
year = "1992",
doi = "10.1016/0895-7177(92)90007-8",
language = "English (US)",
volume = "16",
pages = "65--72",
journal = "Mathematical and Computer Modelling",
issn = "0895-7177",
publisher = "Elsevier Limited",
number = "2",

}

TY - JOUR

T1 - A new Karzanov-type O(n3) max-flow algorithm

AU - Waissi, Gary

PY - 1992

Y1 - 1992

N2 - A new algorithm is presented for finding maximal and maximum value flows in directed single commodity networks. The algorithm gradually converts a combination of blocking preflows and backflows to a maximal flow in the network. Unlike other maximal flow algorithms, the algorithm treats the network more symmetrically by attempting to increase flow on both the ForwardStep and the BackwardStep. The algorithm belongs to the so called phase algorithms, and is applied to Dinic-type layered networks. With an effort of at most O(n3) for maximum value flow, the algorithm ties with the fastest maximum flow algorithms in dense networks, where m ≈ n2, and can therefore be seen as a significant alternate technique. The algorithm is based on the Karzanov [1] algorithm, and shares features with the algorithm of Tarjan [2]. The first version of this algorithm was presented by the author in [3].

AB - A new algorithm is presented for finding maximal and maximum value flows in directed single commodity networks. The algorithm gradually converts a combination of blocking preflows and backflows to a maximal flow in the network. Unlike other maximal flow algorithms, the algorithm treats the network more symmetrically by attempting to increase flow on both the ForwardStep and the BackwardStep. The algorithm belongs to the so called phase algorithms, and is applied to Dinic-type layered networks. With an effort of at most O(n3) for maximum value flow, the algorithm ties with the fastest maximum flow algorithms in dense networks, where m ≈ n2, and can therefore be seen as a significant alternate technique. The algorithm is based on the Karzanov [1] algorithm, and shares features with the algorithm of Tarjan [2]. The first version of this algorithm was presented by the author in [3].

UR - http://www.scopus.com/inward/record.url?scp=44049119733&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=44049119733&partnerID=8YFLogxK

U2 - 10.1016/0895-7177(92)90007-8

DO - 10.1016/0895-7177(92)90007-8

M3 - Article

AN - SCOPUS:44049119733

VL - 16

SP - 65

EP - 72

JO - Mathematical and Computer Modelling

JF - Mathematical and Computer Modelling

SN - 0895-7177

IS - 2

ER -