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.
The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree , booktitle =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
ACCEPT 1representative citing papers
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.