Abstract: The maximum flow problem is a fundamental graph theory problem with many important applications. Max-flow algorithms based on the push-relabel method are known to have better complexity ...

Given a graph G and degree bound B on its nodes, the bounded-degree minimum spanning tree (BDMST) problem is to find a minimum cost spanning tree among the spanning trees with maximum degree B. This bi ...

Abstract: In this talk, I will present a new combinatorial algorithm for maximum flow that is based on running the weighted push-relabel algorithm introduced in [BBST ...

Parallel implementations of the Push-Relabel algorithm using CUDA, MPI, and OpenMP to solve the maximum flow problem efficiently. Each version explores different models of parallelism—GPU acceleration ...

Problem 6.46. Matrix covering. Problem 7.8. Least vital arcs. Write down the maximum flow problem as a linear program. Take the dual. Explain how the dual can be interpreted as a minimum cut problem.