卷別

資料結構及演算法

選擇

國立政治大學 2025 · 考試 · 第 15 題

(4%) Which of the following problems is NP-Hard?

(A)
Given an undirected graph, find the maximum number of vertices that form a complete subgraph.
(B)
Given a directed network, find the maximum flow from the source to the sink.
(C)
Given a bipartite graph, find the maximum number of matching pairs.
(D)
Given two sequences, find the common subsequence of maximal length.

標準解析

AI 已複查