Solution methods for the vertex variant of the network system vulnerability analysis problem
type: Item
instance of: scholarly article
title: Solution methods for the vertex variant of the network system vulnerability analysis problem
zbMATH Open document ID: 1308.93021
DOI: 10.1134/S1064230709040121
published in: Journal of Computer and Systems Sciences International
publication date: 2015-03-23T00:00:00Z
Mathematics Subject Classification ID: 93A15
Mathematics Subject Classification ID: 94C15
zbMATH DE Number: 6418117
author: Irina A. Nazarova
MaRDI profile type: Publication
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: Minimal multicut and maximal integer multiflow: a survey
cites work: Models and methods for solving the problem of network vulnerability
cites work: Q4258216
cites work: Q4198056
cites work: Q3292914
cites work: Q3056948
cites work: Introduction to algorithms
cites work: Multiway cuts in node weighted graphs
cites work: Primal-dual approximation algorithms for integral flow and multicut in trees
cites work: Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
cites work: SOFSEM 2006: Theory and Practice of Computer Science
cites work: Q4035360
cites work: Q4393480
cites work: Parameterized graph separation problems
cites work: An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem
cites work: Graphs with the smallest number of minimum cut sets
cites work: Number of minimum vertex cuts in transitive graphs
cites work: Flow trees for vertex-capacitated networks
cites work: Connectivity of vertex and edge transitive graphs
cites work: Finding good approximate vertex and edge partitions is NP-hard
cites work: A Separator Theorem for Planar Graphs
cites work: Improved approximation algorithms for minimum-weight vertex separators
cites work: Constant factor approximation of vertex-cuts in planar graphs
cites work: Finding small balanced separators
cites work: Graph separators, with applications
cites work: Q4942656
cites work: Computing the Minimum Fill-In is NP-Complete
cites work: Listing all Minimal Separators of a Graph
cites work: GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
cites work: Listing all the minimal separators of a 3-connected planar graph
description: scientific article; zbMATH DE number 6418117