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 $Q\subseteq V$ in a graph $G=(V,E)$. A selective connector is a subgraph of $G$ which…