The minimum recoloring problem to eliminate p-illusion is NP-hard on general directed graphs and bipartite DAGs but solvable in polynomial time on trees, cycles, and outerplanar networks.
Predicting voting outcomes in presence of communities
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Eliminating Illusion in Directed Networks
The minimum recoloring problem to eliminate p-illusion is NP-hard on general directed graphs and bipartite DAGs but solvable in polynomial time on trees, cycles, and outerplanar networks.