Overview
Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore cutting-edge research on graph algorithms in this IEEE conference talk presented by Virginia Williams and Yinzhan Xu from MIT. Delve into the intricacies of monochromatic triangles, triangle listing, and the All-Pairs Shortest Path (APSP) problem, gaining insights into advanced computational techniques and their applications in graph theory and network analysis.
Syllabus
Monochromatic Triangles, Triangle Listing and APSP
Taught by
IEEE FOCS: Foundations of Computer Science