The critical edges in complex networks are extraordinary edges which play more significant
role than other edges on the structure and function of networks. The research on identifying …

Diffusion on networks is an important concept in network science observed in many
situations such as information spreading and rumor controlling in social networks, disease …

Influence maximization is an important problem in network science that aims to detect critical
structures, such as nodes and interactions, with a higher influence on diffusion. It has …

The identification of critical nodes and edges is essential for understanding the structural
and functional aspects of complex networks. Like nodes, edges play a vital role in the …

Graph sparsification aims to reduce the number of edges of a network while maintaining its
accuracy for given tasks. In this study, we propose a novel method called GSGAN, which is …

Given a graph with weights on its vertices and blocking costs on its edges, and a user-
defined threshold τ> 0 τ> 0, the minimum cost edge blocker clique problem (EBCP) is …

We study the minimum cost vertex blocker clique problem (CVCP), which is defined as
follows. Given a simple undirected graph with weights and costs on its vertices and r> 0 …

Edges of public transport network (PTN) play important roles in transporting passengers of
cities, especially in metropolises. Understanding the significant edges of PTN can provide …

The network is a powerful tool to study the interaction of system units, and the edge is an
important part of the network as it represents relationships between nodes. Critical edges …

Influence maximization with application to viral marketing aims to find a small set of
influencers in a social network to maximize the number of influenced users under a certain …