Fast Parallel Index Construction for Efficient K-truss-based Local Community Detection in Large Graphs
Finding cohesive subgraphs is a crucial graph analysis kernel widely used for social and
biological networks (graphs). There exist various approaches for discovering insightful …
biological networks (graphs). There exist various approaches for discovering insightful …
Co-Engaged Location Group Search in Location-Based Social Networks
Searching for well-connected user communities in a Location-based Social Network (LBSN)
has been extensively investigated. However, very few studies focus on finding a group of …
has been extensively investigated. However, very few studies focus on finding a group of …
Adaptive Truss Maximization on Large Graphs: A Minimum Cut Approach
A cohesive subgraph of k-truss requires that each edge has at least (k-2) triangles, which
has wide applications of modeling social communities and complex network visualization …
has wide applications of modeling social communities and complex network visualization …
Scalable Algorithm Design and Performance Analysis for Graph Motifs Discovery
MAM Faysal - 2023 - digitalscholarship.unlv.edu
Discovering motifs or structural patterns, such as communities, is a significant graph
application utilized for classifying groups in social and business networks, identifying similar …
application utilized for classifying groups in social and business networks, identifying similar …