3 citations · 4 across the 3 of their papers we have counts for
3 papers
cs.SI2014★ 1 cited
Minimum Information Dominating Set for Opinion Sampling
Jianhang Gao, Qing Zhao, Anathram Swami
We consider the problem of inferring the opinions of a social network through strategically sampling a minimum subset of nodes by exploiting correlations in node opinions. We first…
cs.NI2013
The Thinnest Path Problem
Jianhang Gao, Qing Zhao, Ananthram Swami
We formulate and study the thinnest path problem in wireless ad hoc networks. The objective is to find a path from a source to its destination that results in the minimum number of…
cs.DS2012★ 3 cited
Dynamic Shortest Path Algorithms for Hypergraphs
Jianhang Gao, Qing Zhao, Wei Ren +3
A hypergraph is a set V of vertices and a set of non-empty subsets of V, called hyperedges. Unlike graphs, hypergraphs can capture higher-order interactions in social and communica…