Given a graph, in the maximum clique problem, one desires to find the largest number of vertices, any two of which are adjacent.
確定! 回上一頁