On dynamic network security: a random decentering algorithm on graphs
From MaRDI portal
Recommendations
- Security of scale-free networks
- scientific article; zbMATH DE number 5952694
- A randomized algorithm for the joining protocol in dynamic distributed networks
- A derandomized approximation algorithm for the critical node detection problem
- A decentralized flow redistribution algorithm for avoiding cascaded failures in complex networks
Cites work
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- A General Framework for Weighted Gene Co-Expression Network Analysis
- Effect of link oriented self-healing on resilience of networks
- Eigenspaces of graphs
- Emergence of Scaling in Random Networks
- Fractional virus epidemic model on financial networks
- Graph spectra in computer science
- Graph spectral techniques in computer sciences
- Graph theoretic and spectral analysis of Enron email data
- On the multiplicities of eigenvalues of graphs and their vertex deleted subgraphs: old and new results
- Scale-free networks: a decade and beyond
This page was built for publication: On dynamic network security: a random decentering algorithm on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1617065)
