Models and methods for solving the problem of network vulnerability

DOI10.1134/S1064230706040083MaRDI QIDQ1951863zbMATH OpenFDO

Authors 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)

Recommendations

• Solution methods for the vertex variant of the network system vulnerability analysis problem
• The analysis of multiuser network systems under uncertainty. VII: The problem of standard vulnerability analysis of a multicommodity flow network
• Lexicographical problem of the analysis of the vulnerability of a multicommodity network
• scientific article; zbMATH DE number 4145634
• An approach to the analysis of possible structural damages in multicommodity network systems

Cites work

• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 3876616 (Why is no real title available?)
• scientific article; zbMATH DE number 3914356 (Why is no real title available?)
• scientific article; zbMATH DE number 4053662 (Why is no real title available?)
• scientific article; zbMATH DE number 1187148 (Why is no real title available?)
• scientific article; zbMATH DE number 3657150 (Why is no real title available?)
• scientific article; zbMATH DE number 3722577 (Why is no real title available?)
• scientific article; zbMATH DE number 45669 (Why is no real title available?)
• scientific article; zbMATH DE number 3503127 (Why is no real title available?)
• scientific article; zbMATH DE number 3578638 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1310280 (Why is no real title available?)
• scientific article; zbMATH DE number 1330033 (Why is no real title available?)
• scientific article; zbMATH DE number 1156170 (Why is no real title available?)
• scientific article; zbMATH DE number 1157599 (Why is no real title available?)
• scientific article; zbMATH DE number 2050721 (Why is no real title available?)
• scientific article; zbMATH DE number 2050722 (Why is no real title available?)
• scientific article; zbMATH DE number 1544632 (Why is no real title available?)
• scientific article; zbMATH DE number 1380004 (Why is no real title available?)
• scientific article; zbMATH DE number 2086913 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• scientific article; zbMATH DE number 871924 (Why is no real title available?)
• A branch-and-cut algorithm for the equicut problem
• A greedy algorithm for multicut and integral multiflow in rooted trees
• A new-old algorithm for minimum-cut and maximum-flow in closure graphs.
• A simple min-cut algorithm
• A sum of disjoint products algorithm for reliability evaluation of flow networks
• An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
• An improved approximation algorithm of MULTIWAY CUT.
• Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
• Approximate max-integral-flow/min-multicut theorems
• Computing All Small Cuts in an Undirected Network
• Emergence of Scaling in Random Networks
• Evaluating network reliability and 2-edge-connected reliability in linear time for bounded pathwidth graphs
• Finding k Cuts within Twice the Optimal
• Finding optimal solutions to the graph partitioning problem with heuristic search
• Formal Methods for Components and Objects
• How the science of complex networks can help developing strategies against terrorism
• Lexicographical problem of the analysis of the vulnerability of a multicommodity network
• Minimal multicut and maximal integer multiflow: a survey
• On the fault-tolerant diameter and wide diameter of ?-connected graphs
• On the weak-integrity of graphs
• Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
• Random sampling in cut, flow, and network design problems
• Randomized approximation schemes for cuts and flows in capacitated graphs
• Relationships between scattering number and other vulnerability parameters
• Scattering number in graphs
• Stochastic network interdiction
• Super-connectivity and super-edge-connectivity for some interconnection networks
• The Complexity of Multiterminal Cuts
• The analysis of multiuser network systems under uncertainty. VII: The problem of standard vulnerability analysis of a multicommodity flow network
• The edge-integrity of some graphs
• The geometry of graphs and some of its algorithmic applications
• The network inhibition problem
• Vulnerability in graphs: the neighbour-integrity of line graphs

Cited in

(10)

• Analysis of critical damage in the communication network. I: Model and computational experiment
• Vulnerability Assessment of Spatial Networks: Models and Solutions
• Analysis of cluster damages in network systems
• An improvement for a mathematical model for distributed vulnerability assessment
• Efficiency and vulnerability analysis for congested networks with random data
• Lexicographical problem of the analysis of the vulnerability of a multicommodity network
• The analysis of multiuser network systems under uncertainty. VII: The problem of standard vulnerability analysis of a multicommodity flow network
• Blocking of energy and resource supply of target objects in network infrastructures
• scientific article; zbMATH DE number 7300343 (Why is no real title available?)
• Solution methods for the vertex variant of the network system vulnerability analysis problem

This page was built for publication: Models and methods for solving the problem of network vulnerability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1951863)