Changjun Wang

most citedApproximability of the Minimum Weighted Doubly Resolving Set Problem

6 citations · 6 across the 3 of their papers we have counts for

collaborators

Showing cs.DMShow all

2 papers · 1 filter

cs.DM2015

Finding Connected Dense $k$ -Subgraphs

Xujin Chen, Xiaodong Hu, Changjun Wang

Given a connected graph $G$ on $n$ vertices and a positive integer $k \leq n$ , a subgraph of $G$ on $k$ vertices is called a $k$ -subgraph in $G$ . We design combinatorial approximatio…

cs.DM2014★ 6 cited

Approximability of the Minimum Weighted Doubly Resolving Set Problem

Xujin Chen, Xiaodong Hu, Changjun Wang

Locating source of diffusion in networks is crucial for controlling and preventing epidemic risks. It has been studied under various probabilistic models. In this paper, we study s…

Finding Connected Dense k-Subgraphs

Approximability of the Minimum Weighted Doubly Resolving Set Problem

Finding Connected Dense $k$ -Subgraphs