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.
Why your friends have more friends than you do.American Journal of Sociology, 96(6):1464–1477
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 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.