to identify the γ-quasi-clique with the maximum size in a graph. It is easy to see that MCP is a ... 80%, our algorithm replacing DCC with BoundedCC per-.
確定! 回上一頁