BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Department of Computer Science - ECPv6.17.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Department of Computer Science
X-ORIGINAL-URL:https://www.cs.jhu.edu
X-WR-CALDESC:Events for Department of Computer Science
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20231105T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20241103T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20240206T103000
DTEND;TZID=America/New_York:20240206T120000
DTSTAMP:20240126T162617Z
CREATED:20240126T162617Z
LAST-MODIFIED:20240126T162617Z
UID:1978309-1707215400-1707220800@www.cs.jhu.edu
SUMMARY:CS Seminar Series: Modern Algorithms for Massive Graphs: Structure and Compression
DESCRIPTION:Refreshments are available starting at 10:30 a.m. The seminar will begin at 10:45 a.m. \nAbstract\nIn the era of big data\, the significant growth in graph size renders numerous traditional algorithms\, including those with polynomial or even linear time complexity\, inefficient. Therefore\, we need novel approaches for efficiently processing massive graphs. In this talk\, Zihan Tan will discuss two modern approaches towards this goal: structure exploitation and graph compression. He will first show how to utilize graph structure to design better approximation algorithms\, showcasing his work on the Graph Crossing Number problem. He will then show how to compress massive graphs into smaller ones while preserving their flow/cut/distance structures\, thereby obtaining faster algorithms. \nSpeaker Biography\nZihan Tan is a postdoctoral associate at DIMACS\, Rutgers University. Before joining DIMACS\, he obtained his PhD from the University of Chicago\, where he was advised by Julia Chuzhoy. He is broadly interested in theoretical computer science\, with a focus on graph algorithms and graph theory. \nZoom link >>
URL:https://www.cs.jhu.edu/event/cs-seminar-series-modern-algorithms-for-massive-graphs-structure-and-compression/
LOCATION:Hackerman B-17
CATEGORIES:Seminars and Lectures
END:VEVENT
END:VCALENDAR