Huang, W., Wang, H., Wen, D., Cao, X., Han, B., Zhang, Y., & Zhang, W. (2026). RLMiner: Finding the Most Frequent k-sized Subgraph via Reinforcement Learning.
Style de citation Chicago (17e éd.)Huang, Wei, Hanchen Wang, Dong Wen, Xin Cao, Bocheng Han, Ying Zhang, et Wenjie Zhang. RLMiner: Finding the Most Frequent K-sized Subgraph via Reinforcement Learning. 2026.
Style de citation MLA (9e éd.)Huang, Wei, et al. RLMiner: Finding the Most Frequent K-sized Subgraph via Reinforcement Learning. 2026.
Attention : ces citations peuvent ne pas être correctes à 100%.