← all papers · overview

Revisiting The Graph Reasoning Ability Of Large Language Models: Case Studies In Translation, Connectivity And Shortest Path

Abstract

Large Language Models (LLMs) have achieved great success in various reasoning tasks. In this work, we focus on the graph reasoning ability of LLMs. Although theoretical studies proved that LLMs are capable of handling graph reasoning tasks, empirical evaluations reveal numerous failures. To deepen our understanding on this discrepancy, we revisit the ability of LLMs on three fundamental graph task

Related papers

Ranked by semantic similarity — how closely each paper's abstract matches this one (100% = near-identical topic).