research
∙
03/07/2023
Fairness-aware Maximal Biclique Enumeration on Bipartite Graphs
Maximal biclique enumeration is a fundamental problem in bipartite graph...
share
research
∙
02/17/2023
Query-Centered Temporal Community Search via Time-Constrained Personalized PageRank
Existing temporal community search suffers from two defects: (i) they ig...
research
∙
11/22/2022
Scalable and Effective Conductance-based Graph Clustering
Conductance-based graph clustering has been recognized as a fundamental ...
research
∙
03/21/2022
Scaling Up Maximal k-plex Enumeration
Finding all maximal k-plexes on networks is a fundamental research probl...
research
∙
07/21/2021
Fairness-aware Maximal Clique Enumeration
Cohesive subgraph mining on attributed graphs is a fundamental problem i...
research
∙
11/07/2019
Mining Bursting Communities in Temporal Graphs
Temporal graphs are ubiquitous. Mining communities that are bursting in ...
research
∙
08/30/2019
Fast Algorithms for Intimate-Core Group Search in Weighted Graphs
Community search that finds query-dependent communities has been studied...
research
∙
04/03/2019