Given a social network with diffusion probabilities as edge weights and a positive integer k,
which k nodes should be chosen for initial injection of information to maximize the influence …

Socially aware networking is an emerging research field that aims to improve the current
networking technologies and realize novel network services by applying social network …

Information cascade in online social networks can be rather negative, eg, the spread of
rumors may trigger panic. To limit the influence of misinformation in an effective and efficient …

The social influence maximization problem is an important research topic for many years
since it has a tremendous impact on society. As social influence can be maximized for many …

The rapid rise and prevalence of social platforms have created great demands on effective
schemes to limit the influence of negative information, eg, blocking key vertices for influence …

Influence maximization is among the most fundamental algorithmic problems in social
influence analysis. Over the last decade, a great effort has been devoted to developing …

This paper considers enumeration of specific subgraphs of a given graph by using a data
structure called a zero-suppressed binary decision diagram (ZDD). A ZDD can represent the …

Our contemporary society survives on the services provided by several network
infrastructures, such as communication, power, and transportation, so their reliability should …

This paper reports on the details of the International Competition on Graph Counting
Algorithms (ICGCA) held in 2023. The graph counting problem is to count the subgraphs …

Communication networks are an essential infrastructure and must be designed carefully to
ensure high reliability. Identifying a fully reliable design is, however, computationally very …