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.
Reviews of modern physics , volume=
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 4roles
background 1polarities
background 1representative citing papers
The paper examines denial-of-service risks to multi-round transaction simulation arising from inter-transaction dependencies in smart-contract state.
citing papers explorer
-
Counting Small Balanced (p,q)-bicliques in Signed Bipartite Graphs
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.
-
Position Paper: Denial-of-Service against Multi-Round Transaction Simulation
The paper examines denial-of-service risks to multi-round transaction simulation arising from inter-transaction dependencies in smart-contract state.
- Evaluating causal indirect effects when mediators are left-censored by assay limit of quantification
- Analytical foundation for adversarial synchronization control in oscillator networks