BriefGPT.xyz
Feb, 2022
大规模实际图中极大k-Plex的列举
Listing Maximal k-Plexes in Large Real-World Graphs
HTML
PDF
Zhengren Wang, Yi Zhou, Mingyun Xiao, Bakhadyr Khoussainov
TL;DR
本文介绍了一种用于在具有小 $k$ 的连通 $k$-plexes 中列出所有最大 $k$-plex 的算法,改进了所有先前已知的结果,同时还提供了几种用于加速算法的技术,实际结果表明,该方法的性能优于现有技术。
Abstract
Listing
dense subgraphs
in large graphs plays a key task in varieties of network analysis applications like
community detection
. Clique, as the densest model, has been widely investigated. However, in practice, c
→