BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Chicago
X-LIC-LOCATION:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260202T201257Z
LOCATION:Second Floor Atrium
DTSTART;TZID=America/Chicago:20251121T080000
DTEND;TZID=America/Chicago:20251121T120000
UID:submissions.supercomputing.org_SC25_sess620_post308@linklings.com
SUMMARY:Parallel Local Motif Counting on Large-Scale Dynamic Graphs
DESCRIPTION:Ali Khan and Sanjukta Bhowmick (University of North Texas) and
  Michela Taufer (University of Tennessee, Knoxville)\n\nGraph motifs—small
  subgraphs such as triangles and cliques—are key tools for comparing and a
 ligning 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 intro
 duce a method to compute local edge-level motif frequencies, capturing the
  motifs incident to each edge. Experiments on real-world networks show tha
 t our approach achieves competitive performance against state-of-the-art s
 tatic algorithms and demonstrate its scalability on shared memory systems 
 and GPUs.\n\nTag: Research & ACM SRC Posters\n\nRegistration Category: Tec
 hnical Program Reg Pass\n\nSession Chairs: Kento Sato (RIKEN Center for Co
 mputational Science (R-CCS)); Anja Gerbes (Georg-August-Universität Göttin
 gen); and Chris Schlipalius (Pawsey Supercomputing Research Centre; Common
 wealth Scientific and Industrial Research Organisation (CSIRO), Australia)
 \n\n
END:VEVENT
END:VCALENDAR