graph-algorithms

This paper studies small language models (SLMs) as closed-loop policies for graph algorithm execution, evaluating both step accuracy and rollout reliability across multiple graph procedures. The results show a gap between local decision quality and global execution reliability, especially for weighted algorithms.

This paper investigates whether aggregate structural invariants, specifically spectral bounds, can accelerate continuous subgraph matching (CSM) over dynamic graphs. It characterizes limitations of lazy spectral maintenance, shows exact maintenance is affordable when selective, and demonstrates pruning power of up to 51% in benchmarks.

This paper introduces GraphDC, a divide-and-conquer multi-agent framework that decomposes graph algorithmic tasks into subgraphs for specialized agents, improving scalability and reasoning performance on complex graph structures.