Local homophily dynamics on bicolored graphs make determining future connectivity between vertices P-complete.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Local Homophily on Bicolored Graphs is $\mathbf{P}$-complete
Local homophily dynamics on bicolored graphs make determining future connectivity between vertices P-complete.