We present a new polynomial-time algorithm for finding maximal cliques in graphs. It is shown that every graph with n vertices and minimum vertex degree δ ...
確定！ 回上一頁
