Efficient maintenance for maximal bicliques in bipartite graph streams
暂无分享,去创建一个
Huadong Dai | Chubo Liu | Yikun Hu | Jianye Yang | Ziyi Ma | Yuling Liu | Yikun Hu | Huadong Dai | Jianye Yang | Chubo Liu | Ziyi Ma | Yuling Liu
[1] Srikanta Tirthapura,et al. Mining maximal cliques from a large graph using MapReduce: Tackling highly uneven subproblem sizes , 2015, J. Parallel Distributed Comput..
[2] Rui Zhou,et al. Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs , 2020, SIGMOD Conference.
[3] Srikanta Tirthapura,et al. Butterfly Counting in Bipartite Networks , 2017, KDD.
[4] Ying Zhang,et al. Exploring Cohesive Subgraphs with Vertex Engagement and Tie Strength in Bipartite Graphs , 2020, Inf. Sci..
[5] Lu Qin,et al. Efficient (α\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\alpha $$\end{document}, β\documentclass[12pt]{minimal} \u , 2020, The VLDB Journal.
[6] Kazuhisa Makino,et al. New Algorithms for Enumerating All Maximal Cliques , 2004, SWAT.
[7] Michael R. Lyu,et al. A generalized Co-HITS algorithm and its application to bipartite graphs , 2009, KDD.
[8] Peter L. Hammer,et al. Consensus algorithms for the generation of all maximal bicliques , 2004, Discret. Appl. Math..
[9] Jun Wang,et al. Unifying user-based and item-based collaborative filtering approaches by similarity fusion , 2006, SIGIR.
[10] Yang Wang,et al. Efficient structure similarity searches: a partition-based approach , 2018, The VLDB Journal.
[11] Jinyan Li,et al. Efficient Mining of Large Maximal Bicliques , 2006, DaWaK.
[12] Venkatesan Guruswami,et al. CopyCatch: stopping group attacks by spotting lockstep behavior in social networks , 2013, WWW.
[13] Xuemin Lin,et al. Efficient and Effective Community Search on Large-scale Bipartite Graphs , 2020, 2021 IEEE 37th International Conference on Data Engineering (ICDE).
[14] Yi-Hsuan Yang,et al. Collaborative Similarity Embedding for Recommender Systems , 2019, WWW.
[15] Ju Fan,et al. Maximizing Multifaceted Network Influence , 2019, 2019 IEEE 35th International Conference on Data Engineering (ICDE).
[16] James Cheng,et al. Distributed Maximal Clique Computation , 2014, 2014 IEEE International Congress on Big Data.
[17] Kai Wang,et al. Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks , 2018, Proc. VLDB Endow..
[18] Xuemin Lin,et al. Efficient (α, β)-core Computation: an Index-based Approach , 2019, WWW.
[19] David Eppstein,et al. Arboricity and Bipartite Subgraph Listing Algorithms , 1994, Inf. Process. Lett..
[20] Xuemin Lin,et al. Towards efficient solutions of bitruss decomposition for large-scale bipartite graphs , 2021, The VLDB Journal.
[21] Celina M. H. de Figueiredo,et al. On the generation of bicliques of a graph , 2007, Discret. Appl. Math..
[22] Srikanta Tirthapura,et al. FLEET: Butterfly Estimation from a Bipartite Graph Stream , 2018, CIKM.
[23] Erich Prisner,et al. Bicliques in Graphs I: Bounds on Their Number , 2000, Comb..
[24] Celina M. H. de Figueiredo,et al. Generating bicliques of a graph in lexicographic order , 2005, Theor. Comput. Sci..
[25] Lhouari Nourine,et al. Enumeration aspects of maximal cliques and bicliques , 2009, Discret. Appl. Math..
[26] Hui Li,et al. Efficient Fault-Tolerant Group Recommendation Using alpha-beta-core , 2017, CIKM.
[27] Rui Wang,et al. An Efficient Algorithm for Enumerating Maximal Bicliques from a Dynamically Growing Graph , 2019, ICNC-FSKD.
[28] Maria E. Orlowska,et al. Efficient Bi-triangle Counting for Large Bipartite Networks , 2021, Proc. VLDB Endow..
[29] Ali Pinar,et al. Peeling Bipartite Networks for Dense Subgraph Discovery , 2016, WSDM.
[30] Srikanta Tirthapura,et al. Enumerating Maximal Bicliques from a Large Graph Using MapReduce , 2017, IEEE Transactions on Services Computing.
[31] Lu Qin,et al. Efficient Bitruss Decomposition for Large-scale Bipartite Graphs , 2020, 2020 IEEE 36th International Conference on Data Engineering (ICDE).
[32] Srikanta Tirthapura,et al. Incremental Maintenance of Maximal Bicliques in a Dynamic Bipartite Graph , 2018, IEEE Transactions on Multi-Scale Computing Systems.
[33] Peter Damaschke,et al. Enumerating maximal bicliques in bipartite graphs with favorable degree sequences , 2014, Inf. Process. Lett..
[34] Yuchen Li,et al. Influence Maximization on Social Graphs: A Survey , 2018, IEEE Transactions on Knowledge and Data Engineering.