Robustness of power-law networks: its assessment and optimization
From MaRDI portal
Publication:326464
DOI10.1007/S10878-015-9893-7zbMATH Open1354.90030OpenAlexW2110844331MaRDI QIDQ326464FDOQ326464
Huiling Zhang, Yilin Shen, My T. Thai
Publication date: 12 October 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9893-7
Recommendations
Cites Work
- Emergence of Scaling in Random Networks
- A critical point for random graphs with a given degree sequence
- Connected components in random graphs with given expected degree sequences
- The degree sequence of a scale-free random graph process
- Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure
- Concentration Inequalities and Martingale Inequalities: A Survey
- Relaxing the uniformity and independence assumptions using the concept of fractal dimension
- The Size of the Giant Component of a Random Graph with a Given Degree Sequence
- Edge vulnerability in neural and metabolic networks
- Quality of future internet services. COST Action 263 final report
- A random graph model for massive graphs
- Cluster-based service discovery for heterogeneous wireless sensor networks
- Bound and exact methods for assessing link vulnerability in complex networks
Cited In (1)
This page was built for publication: Robustness of power-law networks: its assessment and optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q326464)