EstGraph benchmark evaluates LLMs on estimating properties of very large graphs from random-walk samples that fit in context limits.
A faster algorithm for betweenness centrality*
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
A modular open pipeline combining NER, Wikidata linking, and ontology-constrained relation extraction to construct signed temporal knowledge graphs from multilingual political news.
Attribute-based network partitioning with hydraulic and graph features stabilizes pipe roughness calibration, yielding repeatable results comparable to manual methods for key pipes.
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.
-
Mapping Political-Elite Networks in Europe with a Multilingual Joint Entity-Relation Extraction Pipeline
A modular open pipeline combining NER, Wikidata linking, and ontology-constrained relation extraction to construct signed temporal knowledge graphs from multilingual political news.
-
The Elusive Nature of Roughness: Linking Hydraulics and Graph Theory for Water Distribution Networks Model Calibration
Attribute-based network partitioning with hydraulic and graph features stabilizes pipe roughness calibration, yielding repeatable results comparable to manual methods for key pipes.