On a function for the vulnerability of a directed flow network
From MaRDI portal
Recommendations
- On network flow functions
- Network efficiency and vulnerability analysis using the flow‐weighted efficiency measure
- scientific article; zbMATH DE number 961960
- On the robustness of potential-based flow networks
- On vulnerability measures of networks
- Bound and exact methods for assessing link vulnerability in complex networks
- The vulnerability of some networks including cycles via domination parameters
- scientific article; zbMATH DE number 15656
- ANALYZING VULNERABILITIES OF CRITICAL INFRASTRUCTURES USING FLOWS AND CRITICAL VERTICES IN AND/OR GRAPHS
Cited in
(8)- Vulnerability of complex network structures and systems
- A network efficiency measure with application to critical infrastructure networks
- scientific article; zbMATH DE number 3851131 (Why is no real title available?)
- scientific article; zbMATH DE number 867676 (Why is no real title available?)
- \((\psi,p,q)\)-vulnerabilities: a unified approach to network robustness
- Information security: Designing a stochastic-network for throughput and reliability
- Network efficiency and vulnerability analysis using the flow‐weighted efficiency measure
- Empirical study on sufficient numbers of minimum cuts in strongly connected directed random graphs
This page was built for publication: On a function for the vulnerability of a directed flow network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3779973)