4 citations · 7 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2018
Maximizing the Number of Spanning Trees in a Connected Graph
Huan Li, Stacy Patterson, Yuhao Yi +1
We study the problem of maximizing the number of spanning trees in a connected graph by adding at most edges from a given candidate edge set. We give both algorithmic and hardn…
cs.DS2018
Current Flow Group Closeness Centrality for Complex Networks
Huan Li, Richard Peng, Liren Shan +2
Current flow closeness centrality (CFCC) has a better discriminating ability than the ordinary closeness centrality based on shortest paths. In this paper, we extend this notion to…