期刊
INFORMATION SYSTEMS
卷 65, 期 -, 页码 93-105出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.is.2016.12.002
关键词
Graph
资金
- Hong Kong RGC GRF [17200214, 17202715, 521012, 520413]
In this paper, we formulate a novel question on maximum flow queries. Specifically, this problem aims to find which k edges would have the largest impact on a maximum flow query on a network. This problem has important applications in areas like social network and network planning. We show the inapproximability of the problems and present our heuristic algorithms. Experimental evaluations are carried out on real datasets and results show that our algorithms are scalable and return high quality solutions.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据