Presentation
Parallel Local Motif Counting on Large-Scale Dynamic Graphs
DescriptionGraph motifs—small subgraphs such as triangles and cliques—are key tools for comparing and aligning networks in domains ranging from biology to social sciences. While recent advances enable motif counting in billion-edge networks, existing methods focus mainly on global frequencies. Building on ParaDyMS, we introduce a method to compute local edge-level motif frequencies, capturing the motifs incident to each edge. Experiments on real-world networks show that our approach achieves competitive performance against state-of-the-art static algorithms and demonstrate its scalability on shared memory systems and GPUs.
Event Type
Research and ACM SRC Posters
TimeTuesday, 18 November 20258:00am - 5:00pm CST
LocationSecond Floor Atrium
Research & ACM SRC Posters
TP
Archive
view