Metraipolis › archive › dc_c83f1489a2fd

Distributed Balanced Butterfly Counting in Signed Bipartite Graphs — arXiv:2609.21848

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.21848
License (as archived)
CC0-1.0
Archived
2026-10-10T01:40:08.075Z
SHA-256 of the archived text
7185c56e6d6a1eda9ec57f31f7b4b38a99078e6c874cef1c0305820cf74d1b0c
Stable URL of this page
https://metraipolis.com/documento/dc_c83f1489a2fd

How to cite

Distributed Balanced Butterfly Counting in Signed Bipartite Graphs — arXiv:2609.21848 — arXiv (en), https://arxiv.org/abs/2609.21848 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c83f1489a2fd (Metraipolis archive dc_c83f1489a2fd, sha256 7185c56e6d6a1eda9ec57f31f7b4b38a99078e6c874cef1c0305820cf74d1b0c)
BibTeX
@misc{dcc83f1489a2fd,
  title = {Distributed Balanced Butterfly Counting in Signed Bipartite Graphs — arXiv:2609.21848},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.21848},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c83f1489a2fd; sha256 7185c56e6d6a1eda9ec57f31f7b4b38a99078e6c874cef1c0305820cf74d1b0c},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.21848. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The balanced butterfly is a fundamental primitive for analyzing signed bipartite graphs and provides a basis for studying higher-order structural properties, such as clustering coefficients and community structure. Despite its importance, existing approaches primarily rely on serial algorithms for balanced butterfly counting, which become inefficient on large-scale graphs. To address this limitation, we propose a distributed algorithm, D-BBC, based on a hybrid MPI+TBB framework that exploits MPI for inter-process communication and Intel TBB for intra-node parallelism. We conduct an experimental assessment of the proposed approach across 15 real-world datasets. Experimental results demonstrate that, on a single-node distributed system, D-BBC achieves average speedups of 1321x and 16.2x over the serial BB2K and multi-core M-BBC implementations, respectively. Furthermore, D-BBC achieves a maximum speedup of 23.58x over the distributed baseline S-Monarch in terms of end-to-end execution time. These results demonstrate the efficiency of the proposed distributed approach and its potential to enable high- performance signed motif analysis on large-scale bipartite graphs.

Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-21 in cs.DC).
Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC).
Pagina del lavoro: https://arxiv.org/abs/2609.21848 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-10T01:05:30.969Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-09-21?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).