Diameter constrained reliability: Complexity, distinguished topologies and asymptotic behavior
DOI10.1002/net.21654zbMath1386.05182OpenAlexW2174891981MaRDI QIDQ4642429
Pablo Sartor, Pablo Romero, Héctor Cancela, Franco Robledo, Eduardo A. Canale
Publication date: 23 May 2018
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21654
computational complexityrandom graphsplanar graphsnetwork reliabilityMonma graphsdiameter constrained reliabilityGilbert's modelhop-limit
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
This page was built for publication: Diameter constrained reliability: Complexity, distinguished topologies and asymptotic behavior