BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/New_York
X-LIC-LOCATION:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20210402T160552Z
LOCATION:Track 3
DTSTART;TZID=America/New_York:20201119T150000
DTEND;TZID=America/New_York:20201119T163000
UID:submissions.supercomputing.org_SC20_sess160@linklings.com
SUMMARY:Graph Algorithms
DESCRIPTION:Paper\n\nGraphPi: High Performance Graph Pattern Matching thro
 ugh Effective Redundancy Elimination\n\nShi, Zhai, Xu, Zhai\n\nGraph patte
 rn matching, which aims to discover structural patterns in graphs, is cons
 idered one of the most fundamental graph mining problems in real applicati
 ons. Despite previous efforts, existing systems face two main challenges. 
 First, the inherent symmetry existing in patterns can introduce a l...\n\n
 ---------------------\nHigh-Performance Parallel Graph Coloring with Stron
 g Guarantees on Work, Depth and Quality\n\nBesta, Carigiet, Janda, Vonarbu
 rg-Shmaria, Gianinazzi...\n\nWe develop the first parallel graph coloring 
 heuristic with strong theoretical guarantees on work and depth and colorin
 g quality. The key idea is to design a relaxation of the vertex degeneracy
  order, a well-known graph theory concept, and to color vertices in the or
 der dictated by this relaxation. ...\n\n---------------------\nRocket: Eff
 icient and Scalable All-Pairs Computations on Heterogeneous Platforms\n\nH
 eldens, Hijma, van Werkhoven, Maassen, Bal...\n\nAll-pairs compute problem
 s apply a user-defined function to each combination of two items of a give
 n data set. Although these problems present an abundance of parallelism, d
 ata reuse must be exploited to achieve good performance. Several researche
 rs considered this problem, either resorting to parti...\n\n\nTag: Graph A
 lgorithms, Scalable Computing\n\nRegistration Category: Tech Program Reg P
 ass
END:VEVENT
END:VCALENDAR