Yet another approach to the Maximum Flow

2013/02/13 by Björn Hlava, Hlava, Björn
Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Optimization and Search Problems

paper · pdf · doi:10.48550/arxiv.1302.3035

openalex publication_date 2013/02/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

I introduce a new approach to the maximum flow problem by a simple algorithm with a slightly better runtime. This approach is based on sorting arcs insight of vertices on a residual graph. This new approach leads to an O(mn⁰.5) time bound for a network with n vertices and m arcs. Category: Algorithms, Graph Theory and maximum flows

Related

• Max-Flows on Sparse and Dense Networks
• A Fast Max Flow Algorithm
• A Fixed-Parameter Linear-Time Algorithm for Maximum Flow in Planar Flow\n Networks
• Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in O(n^1.5 log n) Time
• Multiple source, single sink maximum flow in a planar graph