Maximal Flow Algorithm was applied to assign tasks to major working committees for the Inter-Collegiate and Campuses Athletic Competition with the optimal number of committees involved in this activity during the A.Y. 2014-2015. Specifically, this aimed to present the existing assignments of major committees in ICCAC, to apply maximal flow algorithm and to find the optimal number of committees assigned in a specific task. Maximal flow problem was applied to every associated task involved in Inter-Collegiate and Campuses Athletic Competition to reduce the target time assigned to each task. Similarly, it also attempted to motivate the major working committees to focus on the major task and work efficiently with an optimal number of committees involved. Existing tasking of major committees in ICCAC was also presented, and several committees have parallel assignments which minimized tasks according to the nature of work. Through the maximal flow algorithm, time spend in performing the assigned task of every major working committees will be reduced and the idle time bound of every task will be minimized.