EstGraph benchmark evaluates LLMs on estimating properties of very large graphs from random-walk samples that fit in context limits.
Structure and evolution of online social networks
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Two new approximation algorithms for SW-TVC on always-star temporal graphs achieve 2Δ-1 and Δ-1 ratios in O(T) and O(TmΔ²) time respectively, with exact solutions for small Δ.
citing papers explorer
-
Evaluating LLMs on Large-Scale Graph Property Estimation via Random Walks
EstGraph benchmark evaluates LLMs on estimating properties of very large graphs from random-walk samples that fit in context limits.
-
New Approximations for Temporal Vertex Cover on Always Star Temporal Graphs
Two new approximation algorithms for SW-TVC on always-star temporal graphs achieve 2Δ-1 and Δ-1 ratios in O(T) and O(TmΔ²) time respectively, with exact solutions for small Δ.