Author:
Hermelin Danny,Manoussakis George
Funder
United States-Israel Binational Science Foundation
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Maximal Biclique Enumeration: A Prefix Tree Based Approach;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13
2. Efficient Maximal Biclique Enumeration on GPUs;Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis;2023-11-11
3. Computing Dense and Sparse Subgraphs of Weakly Closed Graphs;Algorithmica;2023-01-20
4. 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
5. Efficient maximal biclique enumeration for large sparse bipartite graphs;Proceedings of the VLDB Endowment;2022-04