[PDF][PDF] Efficient Truss Decomposition and Maintenance over Dynamic Complex Networks
Z SUN - 2024 - scholars.hkbu.edu.hk
Graph is a widely used model to represent entities and their relationships in many
application domains, such as social and communication networks. In many such …
application domains, such as social and communication networks. In many such …
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 …
[PDF][PDF] An Efficient Multi-core Parallel Implementation of SSSP Algorithm with Decreasing Delta-stepping
R Hassan, S Arifuzzaman - arifuzzaman.faculty.unlv.edu
Single-Source Shortest Path (SSSP) algorithms are essential in various applications, from
optimizing transportation networks to analyzing social networks. This paper focuses on …
optimizing transportation networks to analyzing social networks. This paper focuses on …
[PDF][PDF] MESM: A Query-Agnostic and Memory-Efficient Parallel Subgraph Matching Algorithm
S Kar, S Arifuzzaman - arifuzzaman.faculty.unlv.edu
Subgraph matching, also known as motif finding, is a fundamental problem in graph analysis
with extensive applications. However, identifying subgraphs in large-scale graphs is …
with extensive applications. However, identifying subgraphs in large-scale graphs is …