Blogs (3) >>

This program is tentative and subject to change.

Thu 27 Feb 2025 14:03 - 14:22 at Meeting Rooms 310-311 - Algorithms and Databases

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.

To help students achieve a deeper understanding, we developed iFlow, an interactive visualization tool for the Ford-Fulkerson Algorithm and its variants. iFlow lets users design or import flow networks, and execute the algorithm by hand. In particular, the user can select an augmentation path and amount, and then update the residual graph. The user is given detailed feedback on mistakes, and can also have iFlow auto-complete each step, to use it as a demonstration tool while still in the initial learning stages.

We deployed iFlow in an undergraduate algorithms class, and collected students’ self-reported learning benefits via an optional survey. All respondents considered the tool at least somewhat useful and engaging, with most rating it either as useful/engaging or very useful/engaging. Students also generally reported a significant increase in understanding of the algorithm.

This program is tentative and subject to change.

Thu 27 Feb

Displayed time zone: Eastern Time (US & Canada) change

13:45 - 15:00
Algorithms and DatabasesPapers at Meeting Rooms 310-311
13:45
18m
Talk
Facilitating Student's Learning Transfer in a Database Programming Class
Papers
Yuzhe Zhou Purdue University, Alejandra J. Magana Purdue University, Tianyi Li Purdue University, USA
14:03
18m
Talk
iFlow - An Interactive Max-Flow Min-Cut Algorithms Visualizer
Papers
Muyang Ye University of Southern California, Tianrui Xia University of Southern California, Tianxin Zu University of Southern California, Qian Wang University of Southern California, David Kempe University of Southern California
14:22
18m
Talk
Peer Code Review Methods: An Experience Report from a Data Structures and Algorithms CourseGlobal
Papers
Roxane Koitz-Hristov Graz University of Technology
14:41
18m
Talk
dpvis: A Visual and Interactive Learning Tool for Dynamic Programming
Papers
David H. Lee University of Southern California, Aditya Prasad University of Southern California, Ramiro Deo-Campo Vuong University of Southern California, Tianyu Wang University of Southern California, Eric Han University of Southern California, David Kempe University of Southern California