Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/64596
Title: Finding k most influential edges on flow graphs
Authors: Wong, P
Sun, C
Lo, E
Yiu, ML 
Wu, XW
Zhao, ZC
Chan, THH
Kao, B
Keywords: Graph
Issue Date: 2017
Publisher: Pergamon Press
Source: Information systems, 2017, v. 65, p. 93-105 How to cite?
Journal: Information systems 
Abstract: 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.
URI: http://hdl.handle.net/10397/64596
ISSN: 0306-4379
DOI: 10.1016/j.is.2016.12.002
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

101
Last Week
1
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.