On dynamic network security: a random decentering algorithm on graphs

DOI10.1515/MATH-2018-0059zbMath1403.68175OpenAlexW2810920208WikidataQ114846038 ScholiaQ114846038MaRDI QIDQ1617065

M. T. Trobajo, J. Cifuentes-Rodríguez, Miguel V. Carriegos

Publication date: 7 November 2018

Published in: Open Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/math-2018-0059

zbMATH Keywords

algorithmsnetwork analysiscentralityscale-free graphcybersecurity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fractional virus epidemic model on financial networks
• Graph spectra in computer science
• Graph theoretic and spectral analysis of Enron email data
• Graph spectral techniques in computer sciences
• Emergence of Scaling in Random Networks
• Scale-Free Networks: A Decade and Beyond
• Effect of link oriented self-healing on resilience of networks
• A General Framework for Weighted Gene Co-Expression Network Analysis

This page was built for publication: On dynamic network security: a random decentering algorithm on graphs