YoVDO

Graph Theory Courses

Explicit Near-Fully X-Ramanujan Graphs
IEEE via YouTube
Independent Set on P_k-Free Graphs in Quasi-Polynomial Time
IEEE via YouTube
On Light Spanners, Low-Treewidth Embeddings and Efficient Traversing in Minor-Free Graphs
IEEE via YouTube
Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs
IEEE via YouTube
Subexponential LPs Approximate Max-Cut
IEEE via YouTube
High-Precision Estimation of Random Walks in Small Space
IEEE via YouTube
A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond
IEEE via YouTube
Fast Dynamic Cuts, Distances and Effective Resistance via Vertex Sparsifier
IEEE via YouTube
Near-Optimal Decremental SSSP in Dense Weighted Digraphs
IEEE via YouTube
Tree-Depth and the Formula Complexity of Subgraph Isomorphism
IEEE via YouTube
< Prev Page 14 Next >