855 citations · 983 across the 5 of their papers we have counts for
Showing cs.SIShow all
2 papers · 1 filter
cs.SI2017★ 12 cited
To Be Connected, or Not to Be Connected: That is the Minimum Inefficiency Subgraph Problem
Natali Ruchansky, Francesco Bonchi, David Garcia-Soriano +2
We study the problem of extracting a selective connector for a given set of query vertices in a graph . A selective connector is a subgraph of which…
cs.SI2015★ 24 cited
The Minimum Wiener Connector
Natali Ruchansky, Francesco Bonchi, David Garcia-Soriano +2
The Wiener index of a graph is the sum of all pairwise shortest-path distances between its vertices. In this paper we study the novel problem of finding a minimum Wiener connector:…