Two temporal graphs are order-isomorphic iff they have equal homomorphism counts from all temporal patterns; counting is FPT for bounded toadwidth and dichotomized for total orders.
and Leskovec, Jure , year =
2 Pith papers cite this work, alongside 516 external citations. Polarity classification is still indexing.
2
Pith papers citing it
516
external citations · external index
years
2026 2representative citing papers
EstGraph benchmark evaluates LLMs on estimating properties of very large graphs from random-walk samples that fit in context limits.
citing papers explorer
-
The Parameterised Complexity of Temporal Motif Counting, and a Lov\'asz-Style Isomorphism Theorem
Two temporal graphs are order-isomorphic iff they have equal homomorphism counts from all temporal patterns; counting is FPT for bounded toadwidth and dichotomized for total orders.
-
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.