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
An Introduction to Computer NetworksStanford University via Independent Introduction to Systems Biology
Icahn School of Medicine at Mount Sinai via Coursera Network Analysis in Systems Biology
Icahn School of Medicine at Mount Sinai via Coursera Networks, Crowds and Markets
Cornell University via edX Networking Leadership 101: Building Your Core Professional Network
Center for Creative Leadership via Acumen Academy