ISSN 1944-9488
Vol. 11, Issue 6, 2015November 01, 2015 EDT
Network Topology Vulnerability/Cost Trade-Off: Model, Application, and Computational Complexity
Network Topology Vulnerability/Cost Trade-Off: Model, Application, and Computational Complexity
Articles in Vol. 11, Issue 6, 2015
Vol. 11, Issue 6, 2015
- The Degree Distribution and the Number of Edges Between Nodes of given Degrees in Directed Scale-Free GraphsEvgeniy A. Grechnikov
- Network Topology Vulnerability/Cost Trade-Off: Model, Application, and Computational ComplexityAron LaszkaAssane Gueye
- A New Random Graph Model with Self-Optimizing Nodes: Connectivity and DiameterRichard J. LaMaya Kabkab
- Why Do Simple Algorithms for Triangle Enumeration Work in the Real World?Alyson G. WilsonC. SeshadhriJonathan W. BerryLuke A. FostvedtDaniel J. NordmanCynthia A. Phillips
- The Analysis of Kademlia for Random IDsLuc DevroyeXing Shi Cai
Laszka, Aron, and Assane Gueye. 2015. “Network Topology Vulnerability/Cost Trade-Off: Model, Application, and Computational Complexity.” Internet Mathematics 11 (6). https://doi.org/10.1080/15427951.2015.1018019.
