Push-Relabel algorithm idea： For a network flow graph: the algorithm can be intuitively understood in this way, first add sufficient flow at the source node (The sum of the capacities of all edges ...

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: 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 ...

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 ...

Relabel-to-front is a type of push-relabel algorithm used for solving the maximum flow problem in a directed graph. The maximum flow problem involves finding the maximum amount of flow that can be ...