Solution methods for the vertex variant of the network system vulnerability analysis problem
From MaRDI portal
Publication:2017536
DOI10.1134/S1064230709040121zbMath1308.93021MaRDI QIDQ2017536
Publication date: 23 March 2015
Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primal-dual approximation algorithms for integral flow and multicut in trees
- Minimal multicut and maximal integer multiflow: a survey
- Listing all the minimal separators of a 3-connected planar graph
- Parameterized graph separation problems
- Flow trees for vertex-capacitated networks
- Finding good approximate vertex and edge partitions is NP-hard
- Number of minimum vertex cuts in transitive graphs
- Connectivity of vertex and edge 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
- Finding small balanced separators
- Graphs with the smallest number of minimum cut sets
- Constant factor approximation of vertex-cuts in planar graphs
- Improved approximation algorithms for minimum-weight vertex separators
- An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem
- A Separator Theorem for Planar Graphs
- Computing the Minimum Fill-In is NP-Complete
- Listing all Minimal Separators of a Graph
- Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
- Multiway cuts in node weighted graphs
- GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
- SOFSEM 2006: Theory and Practice of Computer Science
This page was built for publication: Solution methods for the vertex variant of the network system vulnerability analysis problem
