Network robustness and residual closeness
DOI10.1051/ro/2016071zbMath1403.05152OpenAlexW2541266494MaRDI QIDQ4611485
Zeynep Nihan Odabaş Berberler, Aysun Aytaç
Publication date: 18 January 2019
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ro/2016071
Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)
Related Items (10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Facility location and supply chain management. A review
- On a class of posets and the corresponding comparability graphs
- Measuring the vulnerability for classes of intersection graphs
- Effective usage of shortest paths promotes transportation efficiency on scale-free networks
- Tough graphs and Hamiltonian circuits.
- Residual Closeness in Cycles and Related Networks
- RESIDUAL CLOSENESS OF WHEELS AND RELATED NETWORKS
- RESIDUAL CLOSENESS AND GENERALIZED CLOSENESS
- Multiscale vulnerability of complex networks
- EFFICIENCY DYNAMICS ON SCALE-FREE NETWORKS WITH COMMUNITIES
This page was built for publication: Network robustness and residual closeness