Finding the clique number is NP-complete [Kar72]. Further- ... find the densest subgraph on k vertices, is NP-hard [AHI02].
確定! 回上一頁