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

DOI10.1134/S1064230709040121zbMATH Open1308.93021MaRDI QIDQ2017536FDOQ2017536

Irina A. Nazarova

Publication date: 23 March 2015

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints
• 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)