Induced scorpion subgraphs can be counted in O(n^4) time for every k, refuting the conjecture that every non-meager property yields a #W[1]-hard #IndSub problem.
Homomorphisms are a good basis for counting small subgraphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.CC 1years
2025 1verdicts
ACCEPT 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Counting Small Induced Subgraphs: Scorpions Are Easy but Not Trivial
Induced scorpion subgraphs can be counted in O(n^4) time for every k, refuting the conjecture that every non-meager property yields a #W[1]-hard #IndSub problem.