Models and methods for solving the problem of network vulnerability
type: Item
instance of: scholarly article
title: Models and methods for solving the problem of network vulnerability
zbMATH Open document ID: 1263.93020
DOI: 10.1134/S1064230706040083
published in: Journal of Computer and Systems Sciences International
publication date: 2013-05-24T00:00:00Z
Mathematics Subject Classification ID: 93A30
Mathematics Subject Classification ID: 90B15
Mathematics Subject Classification ID: 94C15
zbMATH DE Number: 6166354
author: Irina A. Nazarova
MaRDI profile type: Publication
cites work: Q3912740
cites work: Q3691767
cites work: Q3292914
cites work: A simple min-cut algorithm
cites work: Q4258216
cites work: Q4198056
cites work: Q4739657
cites work: The Complexity of Multiterminal Cuts
cites work: Q3341921
cites work: Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
cites work: An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
cites work: Q4737516
cites work: A greedy algorithm for multicut and integral multiflow in rooted trees
cites work: Minimal multicut and maximal integer multiflow: a survey
cites work: Approximate max-integral-flow/min-multicut theorems
cites work: The geometry of graphs and some of its algorithmic applications
cites work: Q3789603
cites work: Super-connectivity and super-edge-connectivity for some interconnection networks
cites work: On the fault-tolerant diameter and wide diameter of ?-connected graphs
cites work: Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
cites work: Scattering number in graphs
cites work: Relationships between scattering number and other vulnerability parameters
cites work: The edge-integrity of some graphs
cites work: On the weak-integrity of graphs
cites work: How the science of complex networks can help developing strategies against terrorism
cites work: Q3267900
cites work: Emergence of Scaling in Random Networks
cites work: Q4705070
cites work: Q4875196
cites work: Vulnerability in graphs: the neighbour-integrity of line graphs
cites work: Q3840353
cites work: A branch-and-cut algorithm for the equicut problem
cites work: Q4254354
cites work: Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs
cites work: Random sampling in cut, flow, and network design problems
cites work: Finding optimal solutions to the graph partitioning problem with heuristic search
cites work: A new-old algorithm for minimum-cut and maximum-flow in closure graphs.
cites work: Q4452912
cites work: Finding k Cuts within Twice the Optimal
cites work: An improved approximation algorithm of MULTIWAY CUT.
cites work: Evaluating network reliability and 2-edge-connected reliability in linear time for bounded pathwidth graphs
cites work: A sum of disjoint products algorithm for reliability evaluation of flow networks
cites work: Stochastic network interdiction
cites work: The network inhibition problem
cites work: Q4452913
cites work: Q4390413
cites work: The analysis of multiuser network systems under uncertainty. VII: The problem of standard vulnerability analysis of a multicommodity flow network
cites work: Q3996070
cites work: Q4520904
cites work: Computing All Small Cuts in an Undirected Network
cites work: Lexicographical problem of the analysis of the vulnerability of a multicommodity network
cites work: Q4147873
cites work: Q4083324
cites work: Q3856120
cites work: Formal Methods for Components and Objects
cites work: Q4391178
description: scientific article; zbMATH DE number 6166354