想請問以下幾題,順便對下答案
9.假設P不等於NP 當以下問題為P則選1 NP-hard or NP-complete選2 其他選3
(1)Find a longest simple path between two nodes,where the given graph has
positive edge weights.
(2)Find a shortest simple path between two nodes in a directed graph with
negative and/or positive edge weights ,and containing negative weight
cycles.
(3)Find a negative weight directed cycle in a weight directed graph.
(4) "" positive ""
(5)Find a largest cycle in a graph,where the edge-weight is 1 for each edge.
(6) smallest
(7)Find a max-cut in a flow network
(8) min-cut
(9)Find a max independent set in an interval graph
(10)2-CNF SAT problem
想問問大家的答案,目前我寫的是2、7、8、9、10都是NPC,剩下的都不清楚
我很好奇他假設P不等於NP是不是有甚麼陷阱?
還有3既不屬於P又不屬於NPC那是又甚麼??
10.這題有圖片希望大大能自行翻一下
(1)n=8,所以output = 8! ??? (2) ???
↑這題我不曉得要寫甚麼,希望能解釋一下
11.我寫的是F T F F T
12.MAX flow 2+3 = 5,切邊(S,A)(A,C)(C,D)
有些邊流量並沒有滿(如A,C還有1的流量),就直接切了,可以嗎?
求解,感恩