A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Bipartite networks are of great importance in many realworld applications. In bipartite networks, butterfly (i.e., a complete 2 × 2 biclique) is the smallest non-trivial cohesive structure and plays a key role. In this paper, we study the problem of efficient counting the number of butterflies in bipartite networks. The most advanced techniques are based on enumerating wedges which is the dominant cost of counting butterflies. Nevertheless, the existing algorithms cannot efficiently handledoi:10.14778/3339490.3339497 fatcat:xu4vx43bnrcrdgqf6j4duecey4