2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.LG2023★ 2 cited
Rethinking Graph Lottery Tickets: Graph Sparsity Matters
Bo Hui, Da Yan, Xiaolong Ma +1
Lottery Ticket Hypothesis (LTH) claims the existence of a winning ticket (i.e., a properly pruned sub-network together with original weight initialization) that can achieve competi…
cs.DB2021
Efficient Algorithms for Maximal k-Biplex Enumeration
Kaiqiang Yu, Cheng Long, Shengxin Liu +1
Mining maximal subgraphs with cohesive structures from a bipartite graph has been widely studied. One important cohesive structure on bipartite graphs is k-biplex, where each verte…