🕸️ Graph Theory - Handler4605 · Scour

Optimal Hardness of Online Algorithms for Large Common Induced Subgraphs 🔗WCOJ

Succinct trees 🌳B+ Trees

curiouscoding.nl·4d

Theoretical framework can predict how complex networks behave 🌐Distributed Systems

Scope Graphs – A Theory of Name Resolution 🔣Category Theory

pl.ewi.tudelft.nl·6d·Hacker News

Open Data Structures 🌳B+ Trees

W-state graphs: Structure and Algorithms 🧮SMT Solvers

Invariant-Based Diagnostics for Graph Benchmarks 📐E-graphs

A $\mu$-distance for semidirected orchard phylogenetic networks 📇Vector Indexing

Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth 🔗WCOJ

DiBA: Diagonal and Binary Matrix Approximation for Neural Network Weight Compression 🗜️Compression Algorithms

Exact and Approximate Algorithms for Polytree Learning 🌳B+ Trees

Diversity Curves for Graph Representation Learning 📇Vector Indexing

Counting Small Balanced (p,q)-bicliques in Signed Bipartite Graphs 🌸Bloom Filters

Trees and Graphs with Non Log-concave Dominating Set Sequence via AI Tools 🌲B-tree Variants

Local Homophily on Bicolored Graphs is $\mathbf{P}$-complete 🔷Lattice Theory

Hypergraph Generation via Structured Stochastic Diffusion 📉Embeddings Optimization

Vertex connectivity of the nonzero nonunit core of the comaximal graph of $\mathbb Z_n$ 🔷Lattice Theory

Bandits on graphs and structures 🔍Vector Search Algorithms

Matchings on Random Regular Hypergraphs 🔗WCOJ

Sampling Simultaneous Edge-Colorings ✨Shader Programming

Log in to enable infinite scrolling