Correspondence Colouring of Random Graphs
Explore structural results on correspondence chromatic numbers in Erdős-Renyi random graphs, examining predictions, proofs, and conjectures related to Hadwiger's conjecture.
Graph Linear Algebra Part 1
Explore fundamental concepts of graph linear algebra, focusing on matrices, spectral theory, and their applications in algorithmic graph theory and network analysis.
Graph Linear Algebra Part 3 - Data Structures and Optimization for Fast Algorithms
Explore advanced graph linear algebra concepts and optimization techniques for fast algorithms in data structures, building on previous parts.
Graph Linear Algebra Part 2
Explore advanced concepts in graph linear algebra, focusing on data structures and optimization techniques for developing efficient algorithms.
Stretch Factors of Graph Maps and Free Group Automorphisms by Radhika Gupta
Explore stretch factors in graph maps and free group automorphisms, delving into mathematical concepts and their applications in topology and group theory.
Graph Traversal Techniques - Breadth First Search vs Depth First Search
Explore graph traversal techniques: BFS for level-wise exploration and DFS for deep path exploration. Learn implementation steps, applications, and differences between these fundamental algorithms.
The Graph Model for Conflict Resolution - Reflections on Three Decades of Development
Explore the evolution and applications of the Graph Model for Conflict Resolution over 30 years, examining its role in addressing complex climate challenges and decision-making processes.
A Breakthrough in Graph Theory - Numberphile
Explore a breakthrough in graph theory, disproving Hedetniemi's conjecture through counterexamples. Delve into graph coloring, tensor products, and the implications of this mathematical discovery.
The Yellowstone Permutation
Explore the fascinating Yellowstone Permutation sequence, its connection to geysers, and its mathematical properties with Neil Sloane, founder of the OEIS.
Parallel Batch-Dynamic Graph Representations
Explore efficient dynamic graph representations with Aspen and CPAM frameworks, enabling faster updates and space-efficient algorithms for practical applications like dynamic connectivity.
Dynamic Algorithms for Center on Graphs
Efficient approximation algorithms for k-center problem on dynamic graphs with edge updates. Explores novel techniques in dynamic graph theory and algorithm design.
Random Monomial Ideals - Seminar on Applied Geometry and Algebra
Explore probabilistic models of random monomial ideals, their properties, and applications in algebraic geometry. Gain insights into average behavior of ideals and potential for generating algebraic objects.
Graph Algorithms and Coding - Session 5C
Explore advanced graph algorithms and coding techniques in this IEEE session, focusing on cutting-edge research and practical applications in computer science.
Graph Algorithms and Graph Theory - Session 1B
Explore advanced concepts in graph algorithms and theory, delving into cutting-edge research and applications presented at FOCS 2020.
Graph Algorithms and Graph Theory - Session 7A
Explore advanced concepts in graph algorithms and theory, delving into cutting-edge research and applications presented at the FOCS 2020 conference.
Counting Small Induced Subgraphs Satisfying Monotone Properties
Explore techniques for enumerating small induced subgraphs with specific properties, focusing on algorithmic approaches and complexity analysis in graph theory.
Linear Time and Efficient Distributed Algorithms for List Coloring Graphs on Surfaces
Explore efficient algorithms for list coloring graphs on surfaces, focusing on linear time complexity and distributed computing approaches.
Tight Bounds for Online Edge Coloring
Explore cutting-edge algorithms for online edge coloring, examining tight bounds and their implications in graph theory and network optimization.
Faster Minimum k-cut of a Simple Graph
Explore efficient algorithms for finding minimum k-cuts in simple graphs, improving computational speed and complexity for graph partitioning problems.
New Notions and Constructions of Sparsification for Graphs and Hypergraphs
Explore innovative concepts and techniques for graph and hypergraph sparsification, advancing understanding of network structures and algorithms in computer science.
A Characterization of Graph Properties Testable for General Planar Graphs with One-Sided Error
Explore graph properties testable for general planar graphs with one-sided error, focusing on characterization and analysis techniques.