Fast and scalable algorithms for mining subgraphs in a single large graph. - Lam B. Q. Nguyen; Bay Vo; Ngoc-Thao Le; Václav Snásel; Ivan Zelinka (Eng. Appl. Artif. Intell., 2020)

Mining weighted subgraphs in a single large graph. - Ngoc-Thao Le; Bay Vo; Lam B. Q. Nguyen; Hamido Fujita; Bac Le (Inf. Sci., 2020)

A Method for Closed Frequent Subgraph Mining in a Single Large Graph. - Lam B. Q. Nguyen; Loan T. T. Nguyen; Ivan Zelinka; Václav Snásel; Hung Son Nguyen; Bay Vo (IEEE Access, 2021)

Frequent Closed Subgraph Mining: A Multi-thread Approach. - Lam B. Q. Nguyen; Ngoc-Thao Le; Hung Son Nguyen; Tri Pham; Bay Vo (ACIIDS (1), 2022)

An efficient and scalable approach for mining subgraphs in a single large graph. - Lam B. Q. Nguyen; Loan T. T. Nguyen; Bay Vo; Ivan Zelinka; Jerry Chun-Wei Lin; Unil Yun; Hung Son Nguyen (Appl. Intell., 2022)

OWGraMi: Efficient method for mining weighted subgraphs in a single graph. - Ngoc-Thao Le; Bay Vo; Lam B. Q. Nguyen; Bac Le (Expert Syst. Appl., 2022)

Subgraph mining in a large graph: A review. - Lam B. Q. Nguyen; Ivan Zelinka; Václav Snásel; Loan T. T. Nguyen; Bay Vo (WIREs Data Mining Knowl. Discov., 2022)

Mining Association Rules from a Single Large Graph. - Bao Huynh; Lam B. Q. Nguyen; Duc H. M. Nguyen; Ngoc Thanh Nguyen 001; Hung Son Nguyen; Tuyn Pham; Tri Pham; Loan T. T. Nguyen; Trinh D. D. Nguyen; Bay Vo (Cybern. Syst., 2024)