Monochromatic Triangles, Triangle Listing and APSP
Offered By: IEEE via YouTube
Course Description
Overview
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
Tags
Related Courses
Intro to AlgorithmsUdacity Algorithmic Thinking (Part 1)
Rice University via Coursera Design and Analysis of Algorithms
Chennai Mathematical Institute via Swayam Capstone: Analyzing (Social) Network Data
University of California, San Diego via Coursera Algorithms on Graphs
University of California, San Diego via Coursera