190 citations · 769 across the 52 of their papers we have counts for
5 papers · 1 filter
Towards Real-Time Counting Shortest Cycles on Dynamic Graphs: A Hub Labeling Approach
Qingshuai Feng, You Peng, Wenjie Zhang +2
With the ever-increasing prevalence of graph data in a wide spectrum of applications, it becomes essential to analyze structural trends in dynamic graphs on a continual basis. The…
Exploring Cohesive Subgraphs with Vertex Engagement and Tie Strength in Bipartite Graphs
Yizhang He, Kai Wang, Wenjie Zhang +2
We propose a novel cohesive subgraph model called -strengthened -core (denoted as -core), which is the first to consider both tie strength and vertex engagement…
K-Core Maximization through Edge Additions
Zhongxin Zhou, Fan Zhang, Xuemin Lin +2
A popular model to measure the stability of a network is k-core - the maximal induced subgraph in which every vertex has at least k neighbors. Many studies maximize the number of v…
Efficient Butterfly Counting for Large Bipartite Networks
Kai Wang, Xuemin Lin, Lu Qin +2
Bipartite networks are of great importance in many real-world applications. In bipartite networks, butterfly (i.e., a complete 2 x 2 biclique) is the smallest non-trivial cohesive…
When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks
Fan Zhang, Ying Zhang, Lu Qin +2
In this paper, we investigate the problem of (k,r)-core which intends to find cohesive subgraphs on social networks considering both user engagement and similarity perspectives. In…