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.
Fast exact algorithms for some connectivity problems parameterized by clique-width
2 Pith papers cite this work, alongside 18 external citations. Polarity classification is still indexing.
2
Pith papers citing it
18
external citations · OpenAlex
years
2026 2representative citing papers
Establishes tight n^{Theta(k^{d-1})} runtime bounds for d-Clique Packing parameterized by clique-width under ETH for fixed d >= 3.
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.
-
Tight bounds for clique-packing parameterized by clique-width
Establishes tight n^{Theta(k^{d-1})} runtime bounds for d-Clique Packing parameterized by clique-width under ETH for fixed d >= 3.