BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Denver
X-LIC-LOCATION:America/Denver
BEGIN:DAYLIGHT
TZOFFSETFROM:-0700
TZOFFSETTO:-0600
TZNAME:MDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0600
TZOFFSETTO:-0700
TZNAME:MST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260422T000713Z
LOCATION:DEF Concourse
DTSTART;TZID=America/Denver:20231114T100000
DTEND;TZID=America/Denver:20231114T170000
UID:submissions.supercomputing.org_SC23_sess289_spostg129@linklings.com
SUMMARY:Incremental Graph Clustering in Parallel
DESCRIPTION:Md Taufique Hussain (Indiana University)\n\nWe develop a distr
 ibuted memory graph clustering algorithm to find clusters in a graph where
  new nodes and edges are being added incrementally. At each stage of the a
 lgorithm, we maintain a summary of the clustered graph computed from all i
 ncremental batches received thus far. As we receive a new batch of nodes a
 nd edges, we cluster the new graph and merge new clusters with the previou
 s summary clusters. We use sparse linear algebra to perform these operatio
 ns. Our algorithm would make it possible to find clusters in very large gr
 aphs for which regular graph clustering algorithms could not run due to co
 mputation/communication bottlenecks.\n\nRegistration Category: Tech Progra
 m Reg Pass, Exhibits Reg Pass\n\n
END:VEVENT
END:VCALENDAR