Efficient approaches for attaining epidemic-free networks with minimum edge removal set
From MaRDI portal
Publication:6183837
DOI10.1016/j.cnsns.2023.107753MaRDI QIDQ6183837
No author found.
Publication date: 23 January 2024
Published in: Communications in Nonlinear Science and Numerical Simulation (Search for Journal in Brave)
Epidemiology (92D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Systems biology, networks (92C42)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Immunization strategy based on the critical node in percolation transition
- Methods for removing links in a network to minimize the spread of infections
- Optimal link removal for epidemic mitigation: A two-way partitioning approach
- Influence of assortativity and degree-preserving rewiring on the spectra of networks
- Efficient algorithms for updating betweenness centrality in fully dynamic graphs
- A betweenness structural entropy of complex networks
- Epidemic spreading and global stability of an SIS model with an infective vector on complex networks
- Influence maximization by rumor spreading on correlated networks through community identification
- Stability analysis and optimal control in an epidemic model on directed complex networks with nonlinear incidence
- A stochastic simplicial SIS model for complex networks
- Influence maximization through exploring structural information
- A faster algorithm for betweenness centrality*
- Emergence of Scaling in Random Networks
- Networks
- Explosive Percolation in Random Networks
This page was built for publication: Efficient approaches for attaining epidemic-free networks with minimum edge removal set
