TL;DR本文研究了具有高三角密度的图形,从结构的角度证明了这些图形的重要部分包含在密集的半径为 2 的子图的不相交联合中,同时展示该算法回收了近似稳定的 k - 介质实例中的聚类种植。
Abstract
High triangle density -- the graph property stating that a constant fraction
of two-hop paths belong to a triangle -- is a common signature of social
networks. This paper studies triangle-dense graphs from a structural
perspective. We prove constructively that significant portions of a