کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4945118 1438297 2017 35 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Finding k most influential edges on flow graphs
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
پیش نمایش صفحه اول مقاله
Finding k most influential edges on flow graphs
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Systems - Volume 65, April 2017, Pages 93-105
نویسندگان
, , , , , , , ,