🕸️ Graph Theory - Handler4605 · Scour

Faster Algorithms for Shortest Unique or Absent Substrings 🗂️Vector Indexes

A Near-Linear-Time Algorithm for Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs 🧮SMT Solvers

Tree-independence number of $P_5$-free graphs with no large bicliques 🗂️Database Indexing

Revisiting Graph-Tokenizing Large Language Models: A Systematic Evaluation of Graph Token Understanding 🎯Embedding Models

ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop Puzzles 🧮SMT Solvers

Inferring Phylogenetic Networks from Allowed and Forbidden LCA-Constraints 🔗WCOJ

Matroid Algorithms Under Size-Sensitive Independence Oracles 🌸Bloom Filters

Second-Order FALQON Parameter Transfer for the Max-Cut Problem on 3-Regular Graphs 🧮SMT Solvers

Unifying Dynamical Systems and Graph Theory to Mechanistically Understand Computation in Neural Networks 📐E-graphs

Word-Representability of Shift Graphs 🔷Lattice Theory

An Identity for Catalan Numbers via Restricted Dyck Paths 🌀Agda

Tree transducers of linear size-to-height increase (and the additive conjunction of linear logic) 🌳B+ Trees

A fine-grained dichotomy for the center problem on Gromov hyperbolic graphs 🔗WCOJ

Capability centrality: the next step from scale-free property 🌐Distributed Systems

Aitchison Embeddings for Learning Compositional Graph Representations 📌Embedding Retrieval

Replication in Graph Partitioning and Scheduling Problems 🌐Distributed Systems

Position: How can Graphs Help Large Language Models? 🎯Embedding Models

On the power of standard DFS and BFS 🌲B-tree Variants

A Polynomial Kernel for Vertex Deletion to the Scattered Class of Proper Interval Graph and Trees 📐E-graphs

A Unified Approach to Minimizing Symmetric Submodular Functions 💰Cost-Based Optimization

Log in to enable infinite scrolling