On the complexity of color-avoiding site and bond percolation
From MaRDI portal
Publication:2206243
DOI10.1007/978-3-030-10801-4_28zbMath1444.68150arXiv1810.08484OpenAlexW3102441854MaRDI QIDQ2206243
Publication date: 22 October 2020
Full work available at URL: https://arxiv.org/abs/1810.08484
computational complexityattack tolerancecolor-avoiding percolationrobustly connected componentsshared vulnerability
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (2)
Color-avoiding connected spanning subgraphs with minimum number of edges ⋮ Percolation on complex networks: theory and application
This page was built for publication: On the complexity of color-avoiding site and bond percolation