The minimum dominating set (MDS) of the network is a node subset of smallest size that
every node in the network is either in this subset or is adjacent to one or more nodes of this …

In this study, we discuss the impacts of assortative mixing by mask-wearing on the
effectiveness of mask use in suppressing the propagation of epidemics. We employ the …

Spatial epidemic spreading, a fundamental dynamical process upon complex networks,
attracts huge research interest during the past few decades. To suppress the spreading of …

The minimum dominating set (MDS) problem has wide applications in network science and
related fields. It aims at constructing a node set of smallest size such that any node of the …

We generalize an existing binary decision diagram-based (BDD-based) approach of Lozano
and Smith (MP, 2022) to solve a special class of two-stage stochastic programs (2SPs) with …

For a graph formed by vertices and weighted edges, a generalized minimum dominating set
(MDS) is a vertex set of smallest cardinality such that the summed weight of edges from each …

A minimum dominating set for a digraph (directed graph) is a smallest set of vertices such
that each vertex either belongs to this set or has at least one parent vertex in this set. We …

The directed L-distance minimal dominating set (MDS) problem has wide practical
applications in the fields of computer science and communication networks. Here, we study …

There exist numerous heuristic and exact approaches in the literature for addressing
minimum weight dominating set problem (MWDS) on vertex-weighted undirected graphs …

In transportation networks, a spontaneous jamming transition is often observed, eg in urban
road networks and airport networks. Because of this instability, flow distribution is …