首页|期刊导航|计算机科学技术学报（英文版）|Novel Algorithms for Efficient Mining of Connected Induced Subgraphs of a Given Cardinality
计算机科学技术学报（英文版）2025，Vol.40Issue(2)：428-443,16.DOI:10.1007/s11390-024-3039-2
Novel Algorithms for Efficient Mining of Connected Induced Subgraphs of a Given Cardinality
Novel Algorithms for Efficient Mining of Connected Induced Subgraphs of a Given Cardinality
摘要
关键词
graph theory/subgraph enumeration/connected induced subgraph/top-down searchKey words
graph theory/subgraph enumeration/connected induced subgraph/top-down search引用本文复制引用
王珊珊,肖成龙..Novel Algorithms for Efficient Mining of Connected Induced Subgraphs of a Given Cardinality[J].计算机科学技术学报（英文版）,2025,40(2):428-443,16.基金项目
This work was partially supported by the National Natural Science Foundation of China under Grant No.61404069,the Scien-tific Research Project of Colleges and Universities in Guangdong Province of China under Grant No.2021ZDZX1027,the Guang-dong Basic and Applied Basic Research Foundation under Grant Nos.2022A1515110712 and 2023A1515010077,and the STU Scien-tific Research Foundation for Talents under Grant Nos.NTF20016 and NTF20017. （）
