Models and methods for solving the problem of network vulnerability

DOI10.1134/S1064230706040083zbMath1263.93020MaRDI QIDQ1951863

Irina A. Nazarova

Publication date: 24 May 2013

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Applications of graph theory to circuits and networks (94C15)

Related Items

Solution methods for the vertex variant of the network system vulnerability analysis problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimal multicut and maximal integer multiflow: a survey
• Lexicographical problem of the analysis of the vulnerability of a multicommodity network
• A branch-and-cut algorithm for the equicut problem
• On the weak-integrity of graphs
• Super-connectivity and super-edge-connectivity for some interconnection networks
• An improved approximation algorithm of MULTIWAY CUT.
• Evaluating network reliability and 2-edge-connected reliability in linear time for bounded pathwidth graphs
• A greedy algorithm for multicut and integral multiflow in rooted trees
• How the science of complex networks can help developing strategies against terrorism
• The geometry of graphs and some of its algorithmic applications
• Finding optimal solutions to the graph partitioning problem with heuristic search
• The analysis of multiuser network systems under uncertainty. VII: The problem of standard vulnerability analysis of a multicommodity flow network
• Scattering number in graphs
• A new?old algorithm for minimum-cut and maximum-flow in closure graphs
• Random Sampling in Cut, Flow, and Network Design Problems
• Stochastic Network Interdiction
• Emergence of Scaling in Random Networks
• Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
• Approximate max-integral-flow/min-multicut theorems
• The Complexity of Multiterminal Cuts
• Finding k Cuts within Twice the Optimal
• Computing All Small Cuts in an Undirected Network
• A simple min-cut algorithm
• An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
• Vulnerability in graphs: the neighbour-integrity of line graphs
• On the fault-tolerant diameter and wide diameter of ?-connected graphs
• Relationships between scattering number and other vulnerability parameters
• Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
• The network inhibition problem
• Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs
• Formal Methods for Components and Objects
• A sum of disjoint products algorithm for reliability evaluation of flow networks