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

DOI10.1134/S1064230709040121MaRDI QIDQ2017536zbMATH OpenFDO

Authors Irina A. Nazarova

Publication date 23 March 2015

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

Mathematics Subject Classification ID

Large-scale systems (93A15) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Models and methods for solving the problem of network vulnerability
• 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
• An approach to the analysis of possible structural damages in multicommodity network systems
• scientific article; zbMATH DE number 4145634

Cites work

• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 176254 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (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 1161563 (Why is no real title available?)
• scientific article; zbMATH DE number 1414319 (Why is no real title available?)
• A Separator Theorem for Planar Graphs
• An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem
• Computing the Minimum Fill-In is NP-Complete
• Connectivity of vertex and edge transitive graphs
• Constant factor approximation of vertex-cuts in planar graphs
• Finding good approximate vertex and edge partitions is NP-hard
• Finding small balanced separators
• Flow trees for vertex-capacitated networks
• GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
• Graph separators, with applications
• Graphs with the smallest number of minimum cut sets
• Improved approximation algorithms for minimum-weight vertex separators
• Introduction to algorithms
• Listing all Minimal Separators of a Graph
• Listing all the minimal separators of a 3-connected planar graph
• Minimal multicut and maximal integer multiflow: a survey
• Models and methods for solving the problem of network vulnerability
• Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
• Multiway cuts in node weighted graphs
• Network flows. Theory, algorithms, and applications.
• Number of minimum vertex cuts in transitive graphs
• Parameterized graph separation problems
• Primal-dual approximation algorithms for integral flow and multicut in trees
• SOFSEM 2006: Theory and Practice of Computer Science
• The analysis of multiuser network systems under uncertainty. VII: The problem of standard vulnerability analysis of a multicommodity flow network

Cited in

(6)

• An approach to the analysis of possible structural damages in multicommodity network systems
• A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints
• Models and methods for solving the problem of network vulnerability
• ANALYZING VULNERABILITIES OF CRITICAL INFRASTRUCTURES USING FLOWS AND CRITICAL VERTICES IN AND/OR GRAPHS
• Lexicographical problem of the analysis of the vulnerability of a multicommodity network
• Branch-and-cut methods for the network design problem with vulnerability constraints

This page was built for publication: Solution methods for the vertex variant of the network system vulnerability analysis problem

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