Author:
Li Xiaofan,Zhou Rui,Dai Yujun,Chen Lu,Liu Chengfei,He Qiang,Yang Yun
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Incremental Maximal Clique Enumeration for Hybrid Edge Changes in Large Dynamic Graphs;IEEE Transactions on Knowledge and Data Engineering;2023
2. One Set to Cover All Maximal Cliques Approximately;Proceedings of the 2022 International Conference on Management of Data;2022-06-10
3. On Maximising the Vertex Coverage for ${\text{Top}}-k$ t-Bicliques in Bipartite Graphs;2022 IEEE 38th International Conference on Data Engineering (ICDE);2022-05
4. Efficient maximal biclique enumeration for large sparse bipartite graphs;Proceedings of the VLDB Endowment;2022-04
5. Finding a Summary for All Maximal Cliques;2021 IEEE 37th International Conference on Data Engineering (ICDE);2021-04