Graph Theory Courses
IEEE via YouTube Quantum Isomorphism Is Equivalent to Equality of Homomorphism Counts from Planar Graphs
IEEE via YouTube Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian Solving
IEEE via YouTube Lower Bounds for Maximal Matchings and Maximal Independent Sets
IEEE via YouTube Random K-Out Subgraph Leaves Only O-N-K- Inter-Component Edges
IEEE via YouTube Fast Uniform Generation of Random Graphs with Given Degree Sequences
IEEE via YouTube Planar Graphs Have Bounded Queue-Number
IEEE via YouTube Near Optimal Massively Parallel Graph Connectivity
IEEE via YouTube Expander Graphs - Both Local and Global
IEEE via YouTube Adjacency Labelling for Planar Graphs - and Beyond
IEEE via YouTube