complexity theory - Is the k-clique problem NP-complete ...

complexity theory - Is the k-clique problem NP-complete ...

瀏覽:455
日期:2026-04-19
22 Nov 2012 ... Cliques have also been studied in computer science: finding whether there is a clique of a given size in a graph (the clique problem) is ......看更多