With the rapid development of science and technology, the world is becoming increasingly
connected. The following dire need for understanding both the relationships amongst …

In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …

In complex networks, each node has some unique characteristics that define the importance
of the node based on the given application-specific context. These characteristics can be …

Identifying the most influential spreaders is an important issue in understanding and
controlling spreading processes on complex networks. Recent studies showed that nodes …

US8312056B1 - Method and system for identifying a key influencer in social media utilizing
topic modeling and social diffusion analysis - Google Patents US8312056B1 - Method and …

The k-core decomposition in a graph is a fundamental problem for social network analysis.
The problem of k-core decomposition is to calculate the core number for every node in a …

Recent study shows that the accuracy of the k-shell method in determining node coreness in
a spreading process is largely impacted due to the existence of core-like group, which has a …

Mobile advertising in vehicular networks is of great interest with which timely information can
be fast spread into the network. Given a limited budget for hiring seed vehicles, how to …

The stability and robustness of a complex network can be significantly improved by
determining important nodes and by analyzing their tendency to group into clusters. Several …

The k-core of a graph is the largest induced subgraph with minimum degree k. The k-core
decomposition is to find the core number of each vertex in a graph, which is the largest value …