☰
WH
·
CSBank
首頁
題庫專區
模擬考專區
Pro 方案
聯絡我們
首頁
題庫
模擬考
Pro
聯絡
總覽
資料結構
388
演算法
212
作業系統
290
計算機組織與結構
266
離散數學
161
線性代數
182
演算法
›
Ch4 圖論演算法
第 60 題／共 111 題
◀
AL 60/111
錯題回報
00:00
60. Max-Flow、Min-Cut
#AL-04-060
中
Max-Flow
Min-Cut
📝
☆
Consider the maximum flow problem. Assume that all the edge capacities are positive integers. Which of the following statement(s) is(are) correct?
A
(A) There is a polynomial time algorithm to find a maximum cut.
B
(B) There is a polynomial time algorithm to find a minimum cut.
C
(C) There are possibly many distinct flows having maximum flow value with different edge flow on edges.
D
(D) There are possibly many distinct minimum cuts with different total capacities.
E
(E) The sum of the capacity of a minimum cut and the value of a maximum flow must be an even number.
📝 寫筆記
📄 交大110
重做
跳轉到第
題
← 上一題
下一題 →
答案／解析
▤
完整推導請見《WH 資工筆記 · 演算法》Ch4 圖論演算法
‹
本章題號 · 41–60 / 111
›
全部 111
易 42
中 62
難 7
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
