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.
Homomorphisms are a good basis for counting small subgraphs , booktitle =
3 Pith papers cite this work, alongside 44 external citations. Polarity classification is still indexing.
3
Pith papers citing it
44
external citations · external index
representative citing papers
Counting induced k-vertex subgraphs with automorphism group exactly Q is #W[1]-hard for every finite group Q, via clique-scaffold reductions from k-clique.
Incremental (1-ε)-approximate s-t max-flow algorithm achieving Õ(m + n F*/ε) total update time, first with polylog amortized updates for dense graphs.
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.
-
Counting Small Induced Subgraphs: Hardness of Symmetry-Based Properties
Counting induced k-vertex subgraphs with automorphism group exactly Q is #W[1]-hard for every finite group Q, via clique-scaffold reductions from k-clique.
-
Incremental Approximate Maximum Flow via Residual Graph Sparsification
Incremental (1-ε)-approximate s-t max-flow algorithm achieving Õ(m + n F*/ε) total update time, first with polylog amortized updates for dense graphs.