Algorithm 3 G-IR Selection of influential users and locations.

Input: LBSN: $〈G,L〉$; Query: $(R,k,m)$      Output: S-seeds, V-locations 1      Initialization and locations extraction, $L^{\prime }$, are same as in Algorithm 1.      Extract Users checked in at $L^{\prime }$ 3:$G^{\prime }=(U^{\prime },E^{\prime })\mid \{U^{\prime }\subseteq U\wedge U^{\prime }\exists L^{\prime }\}$     ▹ Subgraph of users who checked in at location lying under target region for$i\leftarrow 1:k$do     for all users u $\in U^{\prime }$ do 6:        $U_{CF}^{\prime }=ComputeUserCheckinFreq\left(\mathit{u}\right)$     $S=S\cup \left\{{arg\; max}_{u\in U_{CF}^{\prime }\setminus U^{\prime }}\left\{U_{UF}^{\prime }\right\}\right\}$     $U^{\prime }=U^{\prime }-S$ 9:for$i\leftarrow 1:m$do     for all locations l $\in L^{\prime }$ do         $L_{UF}=ComputeLocationUserFreq\left(\mathit{l}\right)$ 12:    $V=V\cup \left\{{arg\; max}_{l\in L_{UF}\setminus V}\left\{L_{UF}\right\}\right\}$     $L^{\prime }=L^{\prime }-V$ Return $S,V$