On Extracting Socially Tenuous Groups for Online Social Networks With <inline-formula><tex-math notation="LaTeX">$k$</tex-math><alternatives><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>k</mml:mi></mml:math><inline-graphic xlink:href="chen-ieq1-3025911.gif" xmlns:xlink="http://www.w3.org/1999/xlink"/></alternatives></inline-formula>-Triangles | 1 | 0.35 | 2022 |
On Finding Socially Tenuous Groups for Online Social Networks | 3 | 0.37 | 2017 |
When Social Influence Meets Item Inference | 8 | 0.44 | 2016 |
Multicast traffic engineering for software-defined networks | 9 | 0.47 | 2016 |
Multi-Tree Multicast Traffic Engineering for Software-Defined Networks. | 0 | 0.34 | 2015 |
Scalable and bandwidth-efficient multicast for software-defined networks | 5 | 0.44 | 2014 |
Scalable Steiner Tree for Multicast Communications in Software-Defined Networking. | 8 | 0.52 | 2014 |
Some Results on the Target Set Selection Problem | 30 | 1.01 | 2013 |
Target set selection problem for honeycomb networks | 14 | 0.58 | 2013 |
On L(2,1)-labeling of generalized Petersen graphs | 1 | 0.35 | 2012 |
The Target Set Selection Problem on Cycle Permutation Graphs, Generalized Petersen Graphs and Torus Cordalis | 6 | 0.46 | 2011 |