Discovering Hierarchical Subgraphs of K-Core-Truss

Abstract

Discovering dense subgraphs in a graph is a fundamental graph mining task, which has a wide range of applications in social networks, biology and visualization to name a few. Even the problem of computing most cohesive subgraphs is NPhard (like clique, quasi-clique, k-densest subgraph), there exists a polynomial time algorithm for computing the k-core and k-truss. In this paper, we propose a novel dense subgraph model, k-core-truss, which leverages on a new type of important edges based on the basis of k-core and k-truss. We investigate the structural properties of the k-core-truss model. Compared to k-core and k-truss, k-core-truss can significantly discover the interesting and important structural information out the scope of k-core and k-truss. We study two useful problems of k-core-truss decomposition and k-core-truss search. In particular, we develop a k-core-truss decomposition algorithm to find all k-core-truss in a graph G by iteratively removing edges with the smallest degree-support. In addition, we offer a k-core-truss search algorithm to identifying a particular k-core-truss containing a given query node such that the core number k is the largest. Extensive experiments on several web-scale real-world datasets show the effectiveness and efficiency of k-core-truss model and proposed algorithms.

A Graph Theory-Based Modeling of Functional Brain Connectivity Based on EEG: A Systematic Review in the Context of Neuroergonomics

“…Complex networks composed of a large number of nodes and edges require advanced methods to decompose the graph into a nested hierarchy of increasingly cohesive subgraphs [307]. Those include k-core [308], k-truss [307], and k-core-truss [309]. Furthermore, complex structures of the brain network have complex interactions between nodes and a large number of edges.…”

Fast Algorithm for Attributed Community Search

“…Definition 6 (Candidate communities) Given subgraph H ⊆ G and beam width β, we denote a set of candidate communities as C(H), which is defined as time [7]. If a given graph is large, the size of V(H) ∪ N(H) clearly increases.…”

“…5 ) time[7], and it removes node v from H in O(1) time. Hence, the algorithm requires Ω(β|N(H)|) time.…”

Geo-Team Formation Model for Impromptu Activities

“…To tackle the Geo-team formation problem, We propose a three-step solution. In the first two steps, we create a framework that extremely prunes the search space based on (1) spatial distance pruning based on nodes euclidean distance to the team location [16] and (2) social cohesiveness pruning using c-core-truss [9]. Moreover, in the third step, based on the created framework, a maximum flow network is established and considers users with required skills maximum skill weights.…”

“…Still, their social cohesiveness approach does not update the social metric for subgraphs cohesively. To fill this gap, we use the p-core-truss method [9], which recognizes more cohesive subgraphs. Also, MKCSSG ignores skill weights in which could be considered as years of experience (YE).…”