Faster High Accuracy Multi-Commodity Flows via Graph Techniques
Explore graph techniques to accelerate multi-commodity flow algorithms, improving accuracy and efficiency. Discover connections to linear programming and open problems in algorithm design.
Accelerating the Multiplicative-Weights Framework for Graph Linear Programs
Accelerated multiplicative-weight updates framework for solving packing/covering LPs in graph optimization, reducing iterations from Θ(m) to ~Θ(√m) using a packing version of Min-IP oracle.
Recent Progress on Sublinear Time Algorithms for Maximum Matching - Lower Bounds
Explore recent techniques for estimating maximum matching size, focusing on lower bounds and correlation decay methods that lead to super-linear lower bounds for approximations above 2/3.
Bipartite Matching in Nearly-linear Time on Moderately Dense Graphs
Discover efficient algorithms for bipartite matching in moderately dense graphs, exploring nearly-linear time solutions and their implications for graph theory and optimization.
Monochromatic Triangles, Triangle Listing and APSP
Explore efficient algorithms for triangle-related problems and their connections to All-Pairs Shortest Paths, presented by MIT researchers Williams and Xu.
Symmetries, Graph Properties, and Quantum Speedups
Explore quantum speedups in graph theory, focusing on symmetries and properties. Discover cutting-edge research on quantum algorithms and their applications in computational complexity.
A Polynomial Time Approximation Scheme for Facility Location on Planar Graphs
Explore efficient algorithms for facility location on planar graphs, focusing on polynomial time approximation schemes and their applications in network optimization.
Exponentially Faster Massively Parallel Maximal Matching
Discover advanced techniques for optimizing parallel maximal matching algorithms, enhancing efficiency and scalability in large-scale data processing.
Sensitive Distance and Reachability Oracles for Large Batch Updates
Explore efficient algorithms for maintaining distance and reachability information in dynamic graphs, focusing on techniques for handling large batch updates.
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.
Dynamic Graphs - Session 8B
Explore cutting-edge research on dynamic graph algorithms and their applications in computer science at this IEEE FOCS 2020 session.
Dynamic Graphs - Session 7B
Explore cutting-edge research on dynamic graph algorithms and their applications in computer science at this IEEE FOCS 2020 session.
Cryptographic Hash Functions from Arc-Transitive Graphs - Part 1
Explore cryptographic hash functions derived from arc-transitive graphs, focusing on collision resistance, comparisons with Cayley hash functions, and potential attacks.
Sublinear Time Property Testers - Algorithms for Efficient Function Analysis
Explore sublinear time property testers for efficient algorithm design. Learn about relaxed decision problems, fast testers, and applications in graph theory and string processing.
Fine-Grained Complexity and Algorithm Design for Graph Reachability and Distance Problems
Explore advanced algorithms for graph reachability and distance problems, focusing on fine-grained complexity analysis and innovative design techniques.
High-Dimensional Sipser-Spielman Codes - IPAM at UCLA
Exploration of high-dimensional Sipser-Spielman codes, extending expander codes to cell complexes and cellular sheaves, with applications in quantum error correction and coding theory.
Quotient Sparsification for Submodular Functions
Explores sparsification of matroids and submodular functions, unifying graph and hypergraph cut sparsifiers with applications to set systems and algorithmic efficiency.
Angel 3.0 - A Full Stack Machine Learning Platform
Explore Angel 3.0, a comprehensive machine learning platform featuring auto feature engineering, hyperparameter tuning, model serving, and PyTorch integration for enhanced graph embedding and GNN algorithms.
Introducing Graph Theory to Policy-As-Code
Explore graph theory application in Policy-As-Code using Checkov, focusing on relationships between cloud infrastructure resources and enhancing security through custom policies.
A Simple -Approximation Adaptive Sketching Algorithm for Maximum Weighted Matching
Explore a simple algorithm for approximating weighted matching in graphs using adaptive sketching, featuring a primal-dual analysis and multiplicative weight update method.
Lean-HoG: Incorporating a Database of Graphs into a Proof Assistant
Explore the integration of a graph database into a proof assistant, enhancing mathematical reasoning capabilities and streamlining complex proofs in formal verification.