{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T10:41:10Z","timestamp":1791110470008,"version":"4.1.0"},"reference-count":73,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,5,16]],"date-time":"2022-05-16T00:00:00Z","timestamp":1652659200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,5,16]],"date-time":"2022-05-16T00:00:00Z","timestamp":1652659200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001773","name":"University of New South Wales","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001773","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2023,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Bipartite graphs are of great importance in many real-world applications. Butterfly, which is a complete\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$2 \\times 2$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mn>2<\/mml:mn>\n                            <mml:mo>\u00d7<\/mml:mo>\n                            <mml:mn>2<\/mml:mn>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    biclique, plays a key role in bipartite graphs. In this paper, we investigate the problem of efficient counting the number of butterflies. The most advanced techniques are based on enumerating wedges which is the dominant cost of counting butterflies. Nevertheless, the existing algorithms cannot efficiently handle large-scale bipartite graphs. This becomes a bottleneck in large-scale applications. In this paper, instead of the existing layer-priority-based techniques, we propose a vertex-priority-based paradigm\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$${\\mathsf {BFC}}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mi>BFC<\/mml:mi>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    -\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$${\\mathsf {VP}}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mi>VP<\/mml:mi>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    to enumerate much fewer wedges; this leads to a significant improvement of the time complexity of the state-of-the-art algorithms. In addition, we present cache-aware strategies to further improve the time efficiency while theoretically retaining the time complexity of\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$${\\mathsf {BFC}}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mi>BFC<\/mml:mi>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    -\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$${\\mathsf {VP}}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mi>VP<\/mml:mi>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    . We also show that our proposed techniques can work efficiently in external and parallel contexts. Moreover, we study the butterfly counting problem on batch-dynamic graphs. Specifically, given a bipartite graph\n                    <jats:italic>G<\/jats:italic>\n                    and a batch-update of edges\n                    <jats:italic>B<\/jats:italic>\n                    , we aim to maintain the number of butterflies in\n                    <jats:italic>G<\/jats:italic>\n                    . To tackle this problem, fast vertex-priority-based algorithms are proposed with optimizations for reducing the computation of existing wedges in\n                    <jats:italic>G<\/jats:italic>\n                    . Our extensive empirical studies demonstrate that the proposed techniques significantly outperform the baseline solutions on real datasets.\n                  <\/jats:p>","DOI":"10.1007\/s00778-022-00746-0","type":"journal-article","created":{"date-parts":[[2022,5,16]],"date-time":"2022-05-16T15:04:16Z","timestamp":1652713456000},"page":"257-281","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Accelerated butterfly counting with vertex priority on bipartite graphs"],"prefix":"10.1007","volume":"32","author":[{"given":"Kai","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6572-2600","authenticated-orcid":false,"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,5,16]]},"reference":[{"key":"746_CR1","doi-asserted-by":"crossref","unstructured":"Acar, U.A., Anderson, D., Blelloch, G.E., Dhulipala, L.: Parallel batch-dynamic graph connectivity. In: The 31st ACM Symposium on Parallelism in Algorithms and Architectures, pp. 381\u2013392 (2019)","DOI":"10.1145\/3323165.3323196"},{"issue":"9","key":"746_CR2","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J., et al.: The input\/output complexity of sorting and related problems. Commun. ACM 31(9), 1116\u20131127 (1988)","journal-title":"Commun. ACM"},{"key":"746_CR3","unstructured":"Ailamaki, A., DeWitt, D.J., Hill, M.D., Wood, D.A.: Dbmss on a modern processor: Where does time go? In: PVLDB, number DIAS-CONF-1999-001, pp. 266\u2013277 (1999)"},{"issue":"4","key":"746_CR4","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1093\/comnet\/cnx001","volume":"5","author":"SG Aksoy","year":"2017","unstructured":"Aksoy, S.G., Kolda, T.G., Pinar, A.: Measuring and modeling bipartite graphs with community structure. J. Complex Netw. 5(4), 581\u2013603 (2017)","journal-title":"J. Complex Netw."},{"issue":"2","key":"746_CR5","doi-asserted-by":"crossref","first-page":"e1226","DOI":"10.1002\/widm.1226","volume":"8","author":"M Al Hasan","year":"2018","unstructured":"Al Hasan, M., Dave, V.S.: Triangle counting in large networks: a review. Wiley Interdiscipl. Rev. Data Min. Knowl. Discov. 8(2), e1226 (2018)","journal-title":"Wiley Interdiscipl. Rev. Data Min. Knowl. Discov."},{"issue":"3","key":"746_CR6","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF02523189","volume":"17","author":"N Alon","year":"1997","unstructured":"Alon, N., Yuster, R., Zwick, U.: Finding and counting given length cycles. Algorithmica 17(3), 209\u2013223 (1997)","journal-title":"Algorithmica"},{"key":"746_CR7","unstructured":"Auroux, L., Burelle, M., Erra, R.: Reordering very large graphs for fun and profit. In: International Symposium on Web Algorithms (2015)"},{"key":"746_CR8","doi-asserted-by":"crossref","unstructured":"Bauer, R., Wagner, D.: Batch dynamic single-source shortest-path algorithms: An experimental study. In: International Symposium on Experimental Algorithms, pp. 51\u201362. Springer (2009)","DOI":"10.1007\/978-3-642-02011-7_7"},{"key":"746_CR9","doi-asserted-by":"crossref","unstructured":"Becchetti, L., Boldi, P., Castillo, P., Gionis, A.: Efficient semi-streaming algorithms for local triangle counting in massive graphs. In: KDD, pp. 16\u201324. ACM (2008)","DOI":"10.1145\/1401890.1401898"},{"key":"746_CR10","unstructured":"Blandford, D.K., Blelloch, G.E., Kash, I.A.: Compact representations of separable graphs. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 679\u2013688. Society for Industrial and Applied Mathematics (2003)"},{"issue":"1","key":"746_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40649-019-0068-z","volume":"6","author":"HD Boekhout","year":"2019","unstructured":"Boekhout, H.D., Kosters, W.A., Takes, F.W.: Efficiently counting complex multilayer temporal motifs in large-scale networks. Comput. Soc. Netw. 6(1), 1\u201334 (2019)","journal-title":"Comput. Soc. Netw."},{"key":"746_CR12","doi-asserted-by":"crossref","unstructured":"Boldi, P., Rosa, M., Santini, M., Vigna, S.: Layered label propagation: A multiresolution coordinate-free ordering for compressing social networks. In: WWW, pp. 587\u2013596. ACM (2011)","DOI":"10.1145\/1963405.1963488"},{"key":"746_CR13","doi-asserted-by":"crossref","unstructured":"Boldi, P., Santini, M., Vigna, S.: Permuting web graphs. In: International Workshop on Algorithms and Models for the Web-Graph, pp. 116\u2013126. Springer (2009)","DOI":"10.1007\/978-3-540-95995-3_10"},{"issue":"3","key":"746_CR14","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0378-8733(96)00301-2","volume":"19","author":"SP Borgatti","year":"1997","unstructured":"Borgatti, S.P., Everett, M.G.: Network analysis of 2-mode data. Soc. Netw. 19(3), 243\u2013269 (1997)","journal-title":"Soc. Netw."},{"issue":"1","key":"746_CR15","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s00453-015-0036-4","volume":"76","author":"L Bulteau","year":"2016","unstructured":"Bulteau, L., Froese, V., Kutzkov, K., Pagh, R.: Triangle counting in dynamic graph streams. Algorithmica 76(1), 259\u2013278 (2016)","journal-title":"Algorithmica"},{"key":"746_CR16","doi-asserted-by":"crossref","unstructured":"Chang, L., Zhang, C., Lin, X., Qin, L.: Scalable top-k structural diversity search. In: ICDE, pp. 95\u201398. IEEE (2017)","DOI":"10.1109\/ICDE.2017.48"},{"issue":"1","key":"746_CR17","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N Chiba","year":"1985","unstructured":"Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM J. Comput. 14(1), 210\u2013223 (1985)","journal-title":"SIAM J. Comput."},{"key":"746_CR18","doi-asserted-by":"crossref","unstructured":"Chierichetti, F., Kumar, R., Lattanzi, S., Mitzenmacher, M., Panconesi, A., Raghavan, P.: On compressing social networks. In: KDD, pp. 219\u2013228. ACM, (2009)","DOI":"10.1145\/1557019.1557049"},{"issue":"4","key":"746_CR19","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/2382577.2382581","volume":"6","author":"S Chu","year":"2012","unstructured":"Chu, S., Cheng, J.: Triangle listing in massive networks. TKDD 6(4), 17 (2012)","journal-title":"TKDD"},{"key":"746_CR20","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, London (2009)"},{"key":"746_CR21","doi-asserted-by":"crossref","unstructured":"Dhillon, I.S.: Co-clustering documents and words using bipartite spectral graph partitioning. In: KDD, pp. 269\u2013274. ACM (2001)","DOI":"10.1145\/502512.502550"},{"key":"746_CR22","doi-asserted-by":"crossref","unstructured":"Dhulipala, L., Kabiljo, I., Karrer, B., Ottaviano, G., Pupyrev, S., Shalita, A.: Compressing graphs and indexes with recursive graph bisection. In: KDD, pp. 1535\u20131544. ACM (2016)","DOI":"10.1145\/2939672.2939862"},{"key":"746_CR23","doi-asserted-by":"crossref","unstructured":"Ediger, D., Jiang, K., Riedy, K., Bader, D.A.: Massive streaming data analytics: A case study with clustering coefficients. In: 2010 IEEE International Symposium on Parallel and Distributed Processing, Workshops and Phd Forum (IPDPSW), pp. 1\u20138. IEEE (2010)","DOI":"10.1109\/IPDPSW.2010.5470687"},{"issue":"2","key":"746_CR24","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1002\/bult.1720320206","volume":"32","author":"DC Fain","year":"2006","unstructured":"Fain, D.C., Pedersen, J.O.: Sponsored search: A brief history. Bull. Am. Soc. Inf. Sci. Technol. 32(2), 12\u201313 (2006)","journal-title":"Bull. Am. Soc. Inf. Sci. Technol."},{"key":"746_CR25","doi-asserted-by":"crossref","unstructured":"Fang, Y., Huang, X., Qin, L., Zhang, Y., Zhang, W., Cheng, R., Lin, X.: A survey of community search over big graphs. VLDB J. 29(1), 353\u2013392 (2020)","DOI":"10.1007\/s00778-019-00556-x"},{"key":"746_CR26","doi-asserted-by":"crossref","unstructured":"Fang, Y., Wang, K., Lin, X., Zhang, W.: Cohesive subgraph search over big heterogeneous information networks: Applications, challenges, and solutions. In: Proceedings of the 2021 International Conference on Management of Data, pp. 2829\u20132838 (2021)","DOI":"10.1145\/3448016.3457538"},{"key":"746_CR27","doi-asserted-by":"crossref","unstructured":"Green, O., Bader, D.A.: custinger: Supporting dynamic graph algorithms for gpus. In: 2016 IEEE High Performance Extreme Computing Conference (HPEC), pp. 1\u20136. IEEE (2016)","DOI":"10.1109\/HPEC.2016.7761622"},{"key":"746_CR28","doi-asserted-by":"crossref","unstructured":"Han, G., Sethu, H.: Edge sample and discard: A new algorithm for counting triangles in large dynamic graphs. In: 2017 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 44\u201349. IEEE (2017)","DOI":"10.1145\/3110025.3110061"},{"key":"746_CR29","doi-asserted-by":"crossref","unstructured":"Han, S., Zou, L., Yu, J.X.: Speeding up set intersections in graph algorithms using simd instructions. In: SIGMOD, pp. 1587\u20131602. ACM (2018)","DOI":"10.1145\/3183713.3196924"},{"key":"746_CR30","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.ins.2021.04.027","volume":"572","author":"Y He","year":"2021","unstructured":"He, Y., Wang, K., Zhang, W., Lin, X., Zhang, Y.: Exploring cohesive subgraphs with vertex engagement and tie strength in bipartite graphs. Inf. Sci. 572, 277\u2013296 (2021)","journal-title":"Inf. Sci."},{"key":"746_CR31","doi-asserted-by":"crossref","unstructured":"Hu, X., Tao, Y., Chung, C.-W.: Massive graph triangulation. In: SIGMOD, pp. 325\u2013336. ACM (2013)","DOI":"10.1145\/2463676.2463704"},{"issue":"4","key":"746_CR32","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1137\/0207033","volume":"7","author":"A Itai","year":"1978","unstructured":"Itai, A., Rodeh, M.: Finding a minimum circuit in a graph. SIAM J. Comput. 7(4), 413\u2013423 (1978)","journal-title":"SIAM J. Comput."},{"key":"746_CR33","doi-asserted-by":"crossref","unstructured":"Jain, S., Seshadhri, C.: A fast and provable method for estimating clique counts using tur\u00e1n\u2019s theorem. In: WWW, pp. 441\u2013449. International World Wide Web Conferences Steering Committee (2017)","DOI":"10.1145\/3038912.3052636"},{"key":"746_CR34","doi-asserted-by":"crossref","unstructured":"Jha, M., Seshadhri, C., Pinar, A.: Path sampling: A fast and provable method for estimating 4-vertex subgraph counts. In: WWW, pp. 495\u2013505. International World Wide Web Conferences Steering Committee, (2015)","DOI":"10.1145\/2736277.2741101"},{"key":"746_CR35","doi-asserted-by":"crossref","unstructured":"Kang, U., Faloutsos, C.: Beyond\u2019 caveman communities\u2019: Hubs and spokes for graph compression and mining. In: ICDM, pp. 300\u2013309. IEEE (2011)","DOI":"10.1109\/ICDM.2011.26"},{"key":"746_CR36","unstructured":"Kannan, R., Prasanna, V.K., De\u00a0Rose, C.A.F. et\u00a0al.: Receipt: Refine coarse-grained independent tasks for parallel tip decomposition of bipartite graphs. In: Proceedings of the VLDB Endowment, 2020, Estados Unidos. (2020)"},{"issue":"1","key":"746_CR37","first-page":"13","volume":"9","author":"W Khaouid","year":"2015","unstructured":"Khaouid, W., Barsky, M., Srinivasan, V., Thomo, A.: K-core decomposition of large networks on a single pc. PVLDB 9(1), 13\u201323 (2015)","journal-title":"PVLDB"},{"issue":"1\u20132","key":"746_CR38","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1080\/15427951.2012.625260","volume":"8","author":"MN Kolountzakis","year":"2012","unstructured":"Kolountzakis, M.N., Miller, G.L., Peng, R., Tsourakakis, C.E.: Efficient triangle counting in large graphs via degree-based vertex partitioning. Internet Math. 8(1\u20132), 161\u2013185 (2012)","journal-title":"Internet Math."},{"issue":"1","key":"746_CR39","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.socnet.2007.04.006","volume":"30","author":"M Latapy","year":"2008","unstructured":"Latapy, M., Magnien, C., Del Vecchio, N.: Basic notions for the analysis of large two-mode networks. Soc. Netw. 30(1), 31\u201348 (2008)","journal-title":"Soc. Netw."},{"key":"746_CR40","doi-asserted-by":"crossref","unstructured":"Li, R., Wang, P., Jia, P., Zhang, P., Zhao, J., Tao, J., Yuan, Y., Guan, X.: Approximately counting butterflies in large bipartite graph streams. IEEE Trans. Knowl. Data Eng. (2021)","DOI":"10.1109\/TKDE.2021.3062987"},{"issue":"5","key":"746_CR41","doi-asserted-by":"publisher","first-page":"056127","DOI":"10.1103\/PhysRevE.72.056127","volume":"72","author":"PG Lind","year":"2005","unstructured":"Lind, P.G., Gonzalez, M.C., Herrmann, H.J.: Cycles and clustering in bipartite networks. Phys. Rev. E 72(5), 056127 (2005)","journal-title":"Phys. Rev. E"},{"key":"746_CR42","doi-asserted-by":"crossref","unstructured":"Liu, B., Yuan, L., Lin, X., Qin, L., Zhang, W., Zhou, J.: Efficient ($$\\alpha $$, $$\\beta $$)-core computation: An index-based approach. In: WWW, pp. 1130\u20131141. ACM (2019)","DOI":"10.1145\/3308558.3313522"},{"key":"746_CR43","doi-asserted-by":"crossref","unstructured":"Makkar, D., Bader, D.\u00a0A., Green, O.: Exact and parallel triangle counting in dynamic graphs. In: 2017 IEEE 24th International Conference on High Performance Computing (HiPC), pp. 2\u201312. IEEE (2017)","DOI":"10.1109\/HiPC.2017.00011"},{"key":"746_CR44","doi-asserted-by":"crossref","unstructured":"Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: A scalable and dynamic emulation of the butterfly. In: Proceedings of the Twenty-First Annual Symposium on Principles of Distributed Computing, pp. 183\u2013192 (2002)","DOI":"10.1145\/571825.571857"},{"issue":"5594","key":"746_CR45","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network motifs: simple building blocks of complex networks. Science 298(5594), 824\u2013827 (2002)","journal-title":"Science"},{"issue":"1","key":"746_CR46","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1186\/s12918-018-0533-6","volume":"12","author":"K Mukherjee","year":"2018","unstructured":"Mukherjee, K., Hasan, M.M., Boucher, C., Kahveci, T.: Counting motifs in dynamic networks. BMC Syst. Biol. 12(1), 6 (2018)","journal-title":"BMC Syst. Biol."},{"issue":"2","key":"746_CR47","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.socnet.2011.07.001","volume":"35","author":"T Opsahl","year":"2013","unstructured":"Opsahl, T.: Triadic closure in two-mode networks: Redefining the global and local clustering coefficients. Soc. Netw. 35(2), 159\u2013167 (2013)","journal-title":"Soc. Netw."},{"key":"746_CR48","doi-asserted-by":"crossref","unstructured":"Ornstein, M.: Interlocking directorates in Canada: Intercorporate or class alliance? Admin. Sci. Quarterly 210\u2013231 (1984)","DOI":"10.2307\/2393174"},{"issue":"1","key":"746_CR49","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0378-8733(82)90011-9","volume":"4","author":"MD Ornstein","year":"1982","unstructured":"Ornstein, M.D.: Interlocking directorates in Canada: evidence from replacement patterns. Soc. Netw. 4(1), 3\u201325 (1982)","journal-title":"Soc. Netw."},{"key":"746_CR50","doi-asserted-by":"crossref","unstructured":"Palmer, D.: Broken ties: Interlocking directorates and intercorporate coordination. Adminis. Sci. Q. 40\u201355 (1983)","DOI":"10.2307\/2392384"},{"issue":"9","key":"746_CR51","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1109\/TPDS.2004.44","volume":"15","author":"J-S Park","year":"2004","unstructured":"Park, J.-S., Penner, M., Prasanna, V.K.: Optimizing graph algorithms for improved cache performance. IEEE Trans. Parallel Distrib. Syst. 15(9), 769\u2013782 (2004)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"746_CR52","doi-asserted-by":"crossref","unstructured":"Pinar, A., Seshadhri, C., Vishal, V.: Escape: Efficiently counting all 5-vertex subgraphs. In: WWW, pp. 1431\u20131440. International World Wide Web Conferences Steering Committee (2017)","DOI":"10.1145\/3038912.3052597"},{"issue":"1","key":"746_CR53","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1023\/B:CMOT.0000032580.12184.c0","volume":"10","author":"G Robins","year":"2004","unstructured":"Robins, G., Alexander, M.: Small worlds among interlocking directors: network structure and distance in bipartite graphs. Comput. Math. Organ. Theory 10(1), 69\u201394 (2004)","journal-title":"Comput. Math. Organ. Theory"},{"key":"746_CR54","doi-asserted-by":"crossref","unstructured":"Sanei-Mehri, S.-V., Sariyuce, A.\u00a0E., Tirthapura, S.: Butterfly counting in bipartite networks. In: KDD, pp. 2150\u20132159. ACM (2018)","DOI":"10.1145\/3219819.3220097"},{"key":"746_CR55","doi-asserted-by":"crossref","unstructured":"Sanei-Mehri, S.-V., Zhang, Y., Sariy\u00fcce, A.\u00a0E., Tirthapura, S.: Fleet: butterfly estimation from a bipartite graph stream. In: CIKM, pp. 1201\u20131210 (2019)","DOI":"10.1145\/3357384.3357983"},{"key":"746_CR56","doi-asserted-by":"crossref","unstructured":"Sar\u0131y\u00fcce, A.E., Pinar, A.: Peeling bipartite networks for dense subgraph discovery. In: WSDM, pp. 504\u2013512. ACM (2018)","DOI":"10.1145\/3159652.3159678"},{"key":"746_CR57","doi-asserted-by":"crossref","unstructured":"Schank, T., Wagner, D.: Finding, counting and listing all triangles in large graphs, an experimental study. In: International Workshop on Experimental and Efficient Algorithms, pp. 606\u2013609. Springer (2005)","DOI":"10.1007\/11427186_54"},{"key":"746_CR58","doi-asserted-by":"crossref","unstructured":"Seshadhri, C., Pinar, A., Kolda, T.G.: Triadic measures on graphs: The power of wedge sampling. In: SDM, pp. 10\u201318. SIAM (2013)","DOI":"10.1137\/1.9781611972832.2"},{"key":"746_CR59","doi-asserted-by":"crossref","unstructured":"Shi, J., Shun, J.: Parallel algorithms for butterfly computations. In: Symposium on Algorithmic Principles of Computer Systems, pp. 16\u201330. SIAM (2020)","DOI":"10.1137\/1.9781611976021.2"},{"key":"746_CR60","doi-asserted-by":"crossref","unstructured":"Shun, J., Tangwongsan, K.: Multicore triangle computations without tuning. In: ICDE, pp. 149\u2013160. IEEE (2015)","DOI":"10.1109\/ICDE.2015.7113280"},{"issue":"4","key":"746_CR61","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/3059194","volume":"11","author":"LD Stefani","year":"2017","unstructured":"Stefani, L.D., Epasto, A., Riondato, M., Upfal, E.: Triest: Counting local and global triangles in fully dynamic streams with fixed memory size. TKDD 11(4), 43 (2017)","journal-title":"TKDD"},{"key":"746_CR62","doi-asserted-by":"crossref","unstructured":"Suri, S., Vassilvitskii, S.: Counting triangles and the curse of the last reducer. In: WWW, pp. 607\u2013614. ACM (2011)","DOI":"10.1145\/1963405.1963491"},{"issue":"4","key":"746_CR63","first-page":"449","volume":"8","author":"M Then","year":"2014","unstructured":"Then, M., Kaufmann, M., Chirigati, F., Hoang-Vu, T.-A., Pham, K., Kemper, A., Neumann, T., Vo, H.T.: The more the merrier: efficient multi-source graph traversal. PVLDB 8(4), 449\u2013460 (2014)","journal-title":"PVLDB"},{"key":"746_CR64","doi-asserted-by":"crossref","unstructured":"Wang, J., Fu, A.W.-C., Cheng, J.: Rectangle counting in large bipartite graphs. In: BigData Congress, pp. 17\u201324. IEEE (2014)","DOI":"10.1109\/BigData.Congress.2014.13"},{"key":"746_CR65","doi-asserted-by":"crossref","unstructured":"Wang, K., Cao, X., Lin, X., Zhang, X., Qin, L.: Efficient computing of radius-bounded k-cores. In: ICDE, pp. 233\u2013244. IEEE (2018)","DOI":"10.1109\/ICDE.2018.00030"},{"key":"746_CR66","doi-asserted-by":"crossref","unstructured":"Wang, K., Lin, X., Qin, L., Zhang, W., Zhang, Y.: Vertex priority based butterfly counting for large-scale bipartite networks. In: PVLDB (2019)","DOI":"10.14778\/3339490.3339497"},{"key":"746_CR67","doi-asserted-by":"crossref","unstructured":"Wang, K., Lin, X., Qin, L., Zhang, W., Zhang, Y.: Efficient bitruss decomposition for large-scale bipartite graphs. In: ICDE, pp. 661\u2013672. IEEE (2020)","DOI":"10.1109\/ICDE48307.2020.00063"},{"key":"746_CR68","doi-asserted-by":"crossref","unstructured":"Wang, K., Lin, X., Qin, L., Zhang, W., Zhang, W.: Towards efficient solutions of bitruss decomposition for large-scale bipartite graphs. In: VLDB Journal, pp. 1\u201324 (2021)","DOI":"10.1007\/s00778-021-00658-5"},{"key":"746_CR69","doi-asserted-by":"crossref","unstructured":"Wang, K., Zhang, W., Lin, X., Zhang, Y., Qin, L., Zhang, Y.: Efficient and effective community search on large-scale bipartite graphs. In: ICDE. IEEE (2021)","DOI":"10.1109\/ICDE51399.2021.00015"},{"key":"746_CR70","doi-asserted-by":"crossref","unstructured":"Wei, H., Yu, J.X., Lu, C., Lin, X.: Speedup graph processing by graph ordering. In: SIGMOD, pp. 1813\u20131828. ACM (2016)","DOI":"10.1145\/2882903.2915220"},{"issue":"10","key":"746_CR71","first-page":"998","volume":"10","author":"F Zhang","year":"2017","unstructured":"Zhang, F., Zhang, Y., Qin, L., Zhang, W., Lin, X.: When engagement meets similarity: efficient (k, r)-core computation on social networks. PVLDB 10(10), 998\u20131009 (2017)","journal-title":"PVLDB"},{"key":"746_CR72","doi-asserted-by":"crossref","unstructured":"Zhang, F., Zhang, Y., Qin, L., Zhang, W., Lin, X.: Efficiently reinforcing social networks over user engagement and tie strength. In: ICDE, pp. 557\u2013568. IEEE (2018)","DOI":"10.1109\/ICDE.2018.00057"},{"key":"746_CR73","doi-asserted-by":"crossref","unstructured":"Zou, Z.: Bitruss decomposition of bipartite graphs. In: DASFAA, pp. 218\u2013233. Springer (2016)","DOI":"10.1007\/978-3-319-32049-6_14"}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-022-00746-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-022-00746-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-022-00746-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T12:44:51Z","timestamp":1700570691000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-022-00746-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,16]]},"references-count":73,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["746"],"URL":"https:\/\/doi.org\/10.1007\/s00778-022-00746-0","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,16]]},"assertion":[{"value":"2 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 March 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 April 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}