BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//pretalx//cfp.scipy.org//2023//speaker//VTSPJM
BEGIN:VTIMEZONE
TZID:America/Chicago
BEGIN:DAYLIGHT
DTSTART:20220712T000000
TZNAME:CDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0500
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20221106T020000
RDATE:20231105T020000
TZNAME:CST
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20230312T030000
RDATE:20240310T030000
TZNAME:CDT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
SUMMARY:GraphBLAS for Sparse Data and Graphs - Jim Kitchen\, Erik Welch
DTSTART;TZID=America/Chicago:20230712T160500
DTEND;TZID=America/Chicago:20230712T163500
DTSTAMP:20261007T032440Z
UID:pretalx-2023-YESNZB@cfp.scipy.org
DESCRIPTION:GraphBLAS solves graph problems using sparse linear algebra. W
 e are using it to build [`graphblas-algorithms`](https://github.com/python
 -graphblas/graphblas-algorithms)\, a fast backend to NetworkX. [`python-gr
 aphblas`](https://github.com/python-graphblas/python-graphblas/) is faster
  and more capable than `scipy.sparse` for both graph algorithms and sparse
  operations. If you have sparse data or graph workloads that you want to s
 cale and make faster\, then this is for you. Come learn what makes GraphBL
 AS special--and fast!--and how to use it effectively.
LOCATION:Amphitheater 204
URL:https://cfp.scipy.org/2023/talk/YESNZB/
END:VEVENT
END:VCALENDAR