Graph Algorithms Courses and Certifications

Amazing Graph Algorithms : Coding in Java,JavaScript, Python

47 ratings at Udemy

Graph Data Structure, DFS, BFS, Minimum Spanning Tree, Shortest Path, Network Flow, Strongly Connected Components

• Udemy
• 9 hours
• On-Demand
• Paid Course

Simons Institute

Linear and Sublinear Algorithms for Graphlet Sampling

Explore efficient algorithms for graphlet sampling, including linear and sublinear preprocessing techniques, with applications to semi-streaming and MPC settings.

• YouTube
• 33 minutes
• On-Demand
• Free Video

Simons Institute

Sublinear Insights: A Faster Classical Algorithm for Edge Coloring

Explores a novel randomized algorithm for near-linear time graph edge coloring, improving on decades-old methods. Discusses implications for Vizing's theorem and dense graph coloring efficiency.

• YouTube
• 34 minutes
• On-Demand
• Free Video

Simons Institute

Simple Sublinear Algorithms for Vertex Coloring

Dive into advanced graph theory concepts and efficient vertex coloring algorithms, exploring sublinear approaches for optimizing computational complexity.

• YouTube
• 14 minutes
• On-Demand
• Free Video

Simons Institute

Sampling Multiple Edges Efficiently

Dive into efficient algorithms for sampling multiple edges in graphs, exploring innovative techniques and mathematical frameworks presented by MIT researcher Talya Eden.

• YouTube
• 16 minutes
• On-Demand
• Free Video

Association for Computing Machinery (ACM)

Efficient Community Search Based on Relaxed k-truss Index

Explore advanced techniques for efficient community search in networks using relaxed k-truss indexing methods and graph-based algorithms for optimized data analysis.

• YouTube
• 19 minutes
• On-Demand
• Free Video

Simons Institute

Almost-Optimal Sublinear Additive Spanners in Graph Theory

Explore sublinear additive spanners in graph theory, focusing on optimal stretch functions and size bounds for undirected unweighted graphs. Learn about recent advancements and their implications.

• YouTube
• 41 minutes
• On-Demand
• Free Video

USENIX

Seraph: Scalable and Efficient Fully-External Graph Computation via On-Demand Processing

Explores Seraph, a novel fully-external graph computation system that balances scalability and efficiency through on-demand processing, hybrid data formats, and selective pre-computation.

• YouTube
• 21 minutes
• On-Demand
• Free Video

Google TechTalks

One Tree to Rule Them All: Polylogarithmic Universal Steiner Trees and Strong Sparse Partition Hierarchies

Explore polylogarithmic universal Steiner trees and strong sparse partition hierarchies. Learn about new constructions improving approximation guarantees and matching logarithmic lower bounds.

• YouTube
• 57 minutes
• On-Demand
• Free Video

Association for Computing Machinery (ACM)

Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators

Explore efficient parallel algorithms for approximating undirected shortest paths using low hop emulators, with applications and open problems in graph theory and network analysis.

• YouTube
• 22 minutes
• On-Demand
• Free Video

Pinecone

Graph-Based Approximate Nearest Neighbors and HNSW

Explore graph-based algorithms for efficient nearest neighbor search, focusing on HNSW. Learn advantages, construction, and practical applications in large-scale search solutions.

• YouTube
• 59 minutes
• On-Demand
• Free Video

Simons Institute

Graph Data Structures - Part 2

Explore advanced graph data structures and optimization techniques for designing efficient algorithms in this in-depth lecture by Thatchaphol Saranurak.

• YouTube
• 54 minutes
• On-Demand
• Free Video

Simons Institute

Graph Data Structures - Part 1

Explore fundamental graph data structures and their applications in algorithmic optimization, presented by a leading expert from the University of Michigan.

• YouTube
• 58 minutes
• On-Demand
• Free Video

Simons Institute

Graph Data Structures Part 3

Explore advanced graph data structures and optimization techniques for designing efficient algorithms, presented by Thatchaphol Saranurak from the University of Michigan.

• YouTube
• 1 hour 6 minutes
• On-Demand
• Free Video

IEEE

Graph Algorithms and Coding - Session 4C

Explore advanced graph algorithms and coding techniques in this IEEE session, focusing on cutting-edge research and practical applications in computer science.

• YouTube
• 1 hour 15 minutes
• On-Demand
• Free Video