← heapsort
RESEARCH27

GraphDC: A Divide-and-Conquer Multi-Agent System for Scalable Graph Algorithm Reasoning

arXiv CS.AIΒ·May 11, 2026

This paper introduces GraphDC, a Divide-and-Conquer multi-agent system designed to enhance graph algorithm reasoning in Large Language Models (LLMs). It improves performance by decomposing large graphs into smaller subgraphs for specialized agents, with a master agent integrating the results, leading to better scalability and robustness.

Read original β†—