Computational complexity of network vulnerability analysis

DOI10.2478/ausi-2022-0012zbMath1514.05084OpenAlexW4319163255MaRDI QIDQ6160687

Murat Ersen Berberler

Publication date: 26 June 2023

Published in: Acta Universitatis Sapientiae. Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/ausi-2022-0012

zbMATH Keywords

design of algorithmsgraph algorithmsvulnerabilitycomplex networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Cites Work

• Tenacity and rupture degree of permutation graphs of complete bipartite graphs
• Recognizing tough graphs is NP-hard
• On a class of posets and the corresponding comparability graphs
• Measuring the vulnerability for classes of intersection graphs
• Connectivity and edge-disjoint spanning trees
• Closeness centrality in some splitting networks
• Complex networks: structure and dynamics
• Tough graphs and Hamiltonian circuits.
• The Structure and Function of Complex Networks
• Network robustness and residual closeness
• Robustness of Regular Caterpillars
• Link Vulnerability in Networks
• Edge‐tenacious networks
• Computing the Scattering Number of Graphs
• A Note on the Link Residual Closeness of Graphs Under Join Operation
• Rupture degree of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computational complexity of network vulnerability analysis