Sorry, we do not have enough data to show an influence graph for this author.
- Full text PDF available (0)
Journals and Conferences
Ford-Fulkerson algorithm is widely used to solve maximum Graph-Flow problems and it can be applied to a range of different areas, including networking. This paper proposes an approach based on Ford-Fulkerson algorithm to maximize the flow (bandwidth usage) of computer network. Such method mitigates congestion problems and increases network utilization. In… (More)