阿摩線上測驗 登入

申論題資訊

試卷:102年 - 102 國立交通大學_碩士班考試入學試題_資訊聯招:資料結構與演算法#113274
科目:交大◆資工◆資料結構與演算法
年份:102年
排序:0

申論題內容

11. (5%)Suppose that the amount of flow in the maximum flow from source to sink in the network G=(V,E) is f, and that all capacities are integral. Suppose n = |V| and m = |E|. How long would it take at this maximum flow using the Ford-Fulkerson algorithm?_____. Suppose the minimum s-t cut in the network G has x arcs. Suppose that one adds y units of capacity to each arc of G, creating a transformed network G'. The capacity of the minimum cut of G' is at most _____.