Lv11
10 积分 2023-08-17 加入
Finding Near-Optimal Maximum Set of Disjoint $k$-Cliques in Real-World Social Networks
4小时前
已完结
Identifying Maximum Defective Bicliques in Large Bipartite Graphs
5小时前
已完结
TopK-BC: Efficient Maintenance of Top k (p,q)-bicliques over Streaming Bipartite Graphs
5小时前
已完结
Clique Comparator: A Fundamental Operator for Finding a Concise Clique Summary
5小时前
已关闭
Efficient Maximum Balanced k-biplex Search Over Bipartite Graphs
5小时前
已完结
Identifying Maximum Defective Bicliques in Large Bipartite Graphs
2个月前
已完结
Time-Aware Influence Minimization via Blocking Social Networks
2个月前
已完结
Finding a Summary for All Maximal Bicliques
2个月前
已完结
Finding a Summary for All Maximal Cliques
2个月前
已完结
Efficient Maximal Temporal Plex Enumeration
3个月前
已完结
皖公网安备34019202002308
