iFlow - An Interactive Max-Flow Min-Cut Algorithms Visualizer
Year: 2025
Type: conference-paper
Abstract: The Max-Flow/Min-Cut problem is a fundamental tool in graph theory, with applications in many domains, including data mining, image segmentation, transportation planning, and many types of assignment problems, in addition to being an essential building block for many other algorithms. The Ford-Fulkerson Algorithm for Max-Flow/Min-Cut and its variants are therefore commonly taught in undergraduate and beginning graduate algorithms classes. However, these algorithms - and in particular the so-called residual graphs they utilize - often pose significant challenges for students.
Authors: Muyang Ye, Tianrui Xia, Tianxin Zu, Qian Wang, David Kempe
Institution: University of Southern California
Language: English
Subfield: Computer Science Applications
Field: Computer Science
Domain: Physical Sciences
SDG: Quality education
Open Access status: hybrid
OpenAlex ID: W4407760869