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:20211207T054807Z
LOCATION:230-231-232
DTSTART;TZID=America/Chicago:20211117T160000
DTEND;TZID=America/Chicago:20211117T163000
UID:submissions.supercomputing.org_SC21_sess160_pap179@linklings.com
SUMMARY:Discovering and Balancing Fundamental Cycles in Large Signed Graph
 s
DESCRIPTION:Paper\n\nDiscovering and Balancing Fundamental Cycles in Large
  Signed Graphs\n\nAlabandi, Tešić, Rusnak, Burtscher\n\nComputing con
 sensus states via global sign balancing is a key step in social network an
 alysis. This paper presents graphB+, a fast algorithm for balancing signed
  graphs based on a new vertex and edge labeling technique, and a parallel 
 implementation thereof for rapidly detecting and balancing all fundamental
  cycles. The main benefits of graphB+ are that the labels can be computed 
 with linear time complexity, only require a linear amount of memory, and t
 hat the running time for balancing a cycle is linear in the length of the 
 cycle times the vertex degrees but independent of the size of the graph. W
 e parallelized graphB+ using OpenMP and CUDA. It takes 0.85 seconds on a T
 itan V GPU to balance the signs on the edges of an Amazon graph with 10 mi
 llion vertices and 22 million edges, amounting to over 14 million fundamen
 tal cycles identified, traversed, and balanced per second.\n\nTag: Reprodu
 cibility Badge, Algorithms\n\nRegistration Category: Tech Program Reg Pass
 \n\nReproducibility Badges: Artifact Available, Artifact Functional, Resul
 ts Reproduced
END:VEVENT
END:VCALENDAR