CS Events

Computer Science Department Colloquium

Algorithms for Massive Graphs


Download as iCal file

Tuesday, December 15, 2020, 10:00am


Speaker: Professor Aaron Bernstein


Aaron Bernstein is an assistant professor at the University of Rutgers working on graph algorithms. He completed his PhD at Columbia University with Cliff Stein as his advisor.

Location : Via Webex recording

Event Type: Computer Science Department Colloquium

Abstract: Many real-world graphs are too large to be processed by standard algorithms, as examining the entire input would be too slow, and the graph cannot fit in the memory of a single machine. In recent years, much of graph-algorithms research has focused on different models for effectively processing massive graphs. In this talk, I will present my own recent work in this area. I will focus on new approaches to matching and load balancing that lead to new results in many different models. I will also discuss how more efficient data structures for basic graph primitives such as shortest paths can be used to speed up existing algorithms.

Contact  Host: Dr. Matthew Stone

Recording link: https://rutgers.webex.com/rutgers/ldr.php?RCID=0700e86460aa1d63f10675dee8ef3ec5
Pass: Bernstein1