arXiv (All)
open access
Distributed Balanced Butterfly Counting in Signed Bipartite Graphs
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 b
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Distributed Balanced Butterfly Counting in Signed Bipartite Graphs#1006817
- Maximizing Algebraic Connectivity with $2(n-2)$ Edges: The Large Vertex Number Case#1084316
- An Exhaustive Census of Main-Diagonal Symmetric Costas Arrays of Orders 37-42#792938
- An Exhaustive Census of Main-Diagonal Symmetric Costas Arrays of Orders 37-42#788934
- Multiplicative Attributes Derived from Graph Invariants for Saztec4 Diamond#274870
Record · ID 1036237
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive