Experimental results show that AMBEA is 1.15- to 5.32- faster than its closest competitor and exhibits better scalability and parallelization capabilities on ...
Experimental results show that AMBEA is 1.15× to 5.32× faster than its closest competitor and exhibits better scalability and parallelization capabilities on ...
Enumeration of Billions of Maximal Bicliques in Bipartite Graphs ... AMBEA: Aggressive Maximal Biclique Enumeration in Large Bipartite Graph Computing.
Maximal bicliques are effective to reveal meaningful information hidden in bipartite graphs. Maximal biclique enumeration (MBE) is challenging since the number ...
Missing: AMBEA: | Show results with:AMBEA:
Xuechen Zhang's 20 research works with 112 citations, including: AMBEA: Aggressive Maximal Biclique Enumeration in Large Bipartite Graph Computing.
AMBEA: Aggressive Maximal Biclique Enumeration in Large Bipartite Graph Computing · Computer Science, Mathematics. IEEE Transactions on Computers · 2024.
In this paper, a powerful new algorithm is described that produces all maximal bicliques in a bipartite graph.
Missing: AMBEA: | Show results with:AMBEA:
AMBEA: Aggressive Maximal Biclique Enumeration in Large Bipartite Graph Computing ... Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs.
Our experimental results show that AdaMBE is 1.6×−49.7× faster than its closest CPU-based competitor and successfully enumerates all 19 billion maximal ...
Missing: Aggressive | Show results with:Aggressive
AMBEA: Aggressive Maximal Biclique Enumeration in Large Bipartite Graph Computing, IEEE Transactions on Computers, Vol. 73, No. 12, Journal, December, 2024.