Journal
INFORMATION SYSTEMS
Volume 65, Issue -, Pages 93-105Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.is.2016.12.002
Keywords
Graph
Categories
Funding
- Hong Kong RGC GRF [17200214, 17202715, 521012, 520413]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available