BBVP, a vertex-based pruning algorithm, counts balanced (p,q)-bicliques in signed bipartite graphs with an average 636x speedup over the adapted SBCList++ baseline for p=q=3 on large real-world data.
Social networks , volume=
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Graph-augmented LLMs using a political knowledge graph improve ideology prediction accuracy for Swiss MPs by incorporating relational data beyond text alone.
citing papers explorer
-
Graph-Augmented LLMs for Swiss MP Ideology Prediction
Graph-augmented LLMs using a political knowledge graph improve ideology prediction accuracy for Swiss MPs by incorporating relational data beyond text alone.