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:20260422T000620Z
LOCATION:401-402
DTSTART;TZID=America/Denver:20231114T103000
DTEND;TZID=America/Denver:20231114T120000
UID:submissions.supercomputing.org_SC23_sess155@linklings.com
SUMMARY:Graph Algorithms in HPC
DESCRIPTION:PeeK: A Prune-Centric Approach for K Shortest Path Computation
 \n\nThe 𝐾 shortest path (KSP) algorithm, which finds the top 𝐾 shortest si
 mple paths from a given source to a target vertex, has a wide range of rea
 l-world applications. While the top 𝐾 shortest simple paths offer invaluab
 le insights, computing them is time-consuming. In this wor...\n\n\nWang Fe
 ng (University of North Texas), Shiyang Chen and Hang Liu (Rutgers Univers
 ity), and Yuede Ji (University of North Texas)\n---------------------\nA G
 PU Algorithm for Detecting Strongly Connected Components\n\nDetecting stro
 ngly connected components (SCCs) is an important step in various graph com
 putations. The fastest GPU and CPU implementations from the literature wor
 k well on graphs where most of the vertices belong to a single SCC and the
  vertex degrees follow a power-law distribution. However, these ...\n\n\nG
 hadeer Alabandi (Texas State University); William Sands and George Biros (
 University of Texas, Oden Institute); and Martin Burtscher (Texas State Un
 iversity)\n---------------------\nEfficient Maximal Biclique Enumeration o
 n GPUs\n\nMaximal biclique enumeration (MBE) in bipartite graphs is an imp
 ortant problem in data mining with many real-world applications. All exist
 ing solutions for MBE are designed for CPUs. Parallel MBE algorithms for G
 PUs are needed for MBE acceleration leveraging its many computing cores. H
 owever, enumer...\n\n\nZhe Pan, Shuibing He, and Xu Li (Zhejiang Universit
 y); Xuechen Zhang (Washington State University, Vancouver); and Rui Wang a
 nd Gang Chen (Zhejiang University)\n\nTag: Accelerators, Algorithms, Graph
  Algorithms and Frameworks\n\nRegistration Category: Tech Program Reg Pass
 \n\nReproducibility Badges: Artifact Available, Artifact Functional, Resul
 ts Reproduced\n\nSession Chair: Marco Minutoli (Advanced Micro Devices)
END:VEVENT
END:VCALENDAR