SOURCE-LINKED INTELLIGENCE

GTA: Graph Theory Agent and Benchmark for Algorithmic Graph Reasoning with LLMs

arXiv · AI, language, vision and robotics · article · Sep 10, 2026 · UTC

Large Language Models (LLMs) are increasingly asked to reason over structured data such as graphs, yet how reliably they can carry out multi-step graph algorithms in language remains unclear. Existing evaluations tend to use simple tasks on small graphs, to score code generation rather than reasoning over the graph itself, or to fix a single input format. We introduce Graph Theory Bench (GT Bench), a benchmark covering 24 classical graph problems in 44 task-structure settings, with over 100,000 examples across four representations: natural language, structured language, adjacency list, and adj

Read original source ↗ Open in workspace

recordType

paper

region

Global