Counting Cohesive Subgraphs with Hereditary Properties
Track: Graph algorithms and modeling for the Web
Keywords: Hereditary Cohesive Subgraph Counting;plex counting;deftective clique counting;subgraph scounting
Abstract: The classic clique model has properties of hereditaries and cohesiveness. Here hereditaries means a subgraph of a clique is still a clique. Counting small cliques in a graph is a fundamental operation of numerous applications. However, the clique model is often too restrictive for practical use, leading to the focus on other relaxed-cliques with properties of hereditaries and cohesiveness. To address this issue, we investigate a new problem of counting general hereditary cohesive subgraphs (\hcs). All subgraphs with properties of hereditaries and cohesiveness can be called a kind of \hcs. To count \hcs, we propose a general framework called \hcspivot, which can be applied to count all kinds of \hcs. \hcspivot can count most \hcs combinatorially without explicitly listing them. Two additional noteworthy features of \hcspivot are its ability to (1) simultaneously count \hcs of any size and (2) simultaneously count \hcs for each node or each edge. Based on our \hcspivot framework, we propose two novel algorithms with several carefully designed pruning techniques to count $s$-defective cliques and $s$-plexes, which are two specific types of \hcs. We conduct extensive experiments on 8 large real-world graphs, and the results demonstrate the high efficiency and effectiveness of our solutions.
Submission Number: 2336
Loading