从不确定图中发现K紧密子图.pdf

ISSN 1673-9418 CODEN JKYTA8 E-mail: fcst@ Journal of Frontiers of Computer Science and Technology 1673-9418/2011/05(09)-0791-13 Tel: +86-10 DOI: 10.3778/j.issn.1673-9418.2011.09.003 K * 1 1,2+ 2 韩 蒙 , 李建中 , 邹兆年 1. 黑龙江大学 计算机科学技术学院, 哈尔滨 150080 2. 哈尔滨工业大学 计算机科学与技术学院, 哈尔滨 150001 * Finding K Close Subgraphs in an Uncertain Graph 1 1,2+ 2 HAN Meng , LI Jianzhong , ZOU Zhaonian 1. School of Computer Science and Technology, Heilongjiang University, Harbin 150080, China 2. School of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001, China + Corresponding author: E-mail: lijzh@ HAN Meng, LI Jianzhong, ZOU Zhaonian. Finding K close subgraphs in an uncertain graph. Journal of Frontiers of Computer Science and Technology, 2011, 5(9): 791-803. Abstract: Uncertainty is inherent in many of graphs which are abstracted from protein-protein interaction (PPI) networks, social networks or wireless communication networks. How to get the valuable information, such as the crucial function group in PPI networks, the group which makes advertisers more properly, and the nodes which guarantee to communicate with their neighboring nodes well, plays an important role in practical settings. This paper shows that the problem to find the closest subgraph is NP-Hard, and proposes an efficient search-tree based algo- rithm with pruning techniques TreeClose. Because search-tree based algorithm TreeClose needs too large space when processi