各種の疑似クリーク列挙アルゴリズムの実験的性能比較

抄録

In the problem of finding pseudo-cliques, namely k-plexes, it becomes harder to enumerate all of them as we allow more number of disconnection among vertices in them. Particularly, there often exist a huge number of possible solutions with medium or small size which cannot be regarded as dense vertex sets. To overcome the difficulty, the authors have proposed two algorithms, J-CoreMaxKPlex and MetaClique, which can exclusively enumerate dense pseudo-cliques among them. A constraint on connectivity based on the notion of j-core is taken into account in the former and a structural constraint based on the notion of meta-cliques in the latter. In this report, we empirically observe performance of the algorithms for several graphs and then show their characteristics, comparing with an improved standard maximal k-plex enumerator.