Models and methods for solving the problem of network vulnerability (Q1951863): Difference between revisions

@@ Property / author @@
-Irina A. Nazarova
@@ Property / author: Irina A. Nazarova / rank @@
-Normal rank
@@ Property / author @@
+Irina A. Nazarova
@@ Property / author: Irina A. Nazarova / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q3912740
@@ Property / cites work: Q3912740 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3691767
@@ Property / cites work: Q3691767 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3292914
@@ Property / cites work: Q3292914 / rank @@
+Normal rank
@@ Property / cites work @@
+A simple min-cut algorithm
@@ Property / cites work: A simple min-cut algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Multiterminal Cuts
@@ Property / cites work: The Complexity of Multiterminal Cuts / rank @@
+Normal rank
@@ Property / cites work @@
+Q3341921
@@ Property / cites work: Q3341921 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
+Normal rank
@@ Property / cites work @@
+An <i>O</i>(log <i>k</i>) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
+Normal rank
@@ Property / cites work @@
+Q4737516
@@ Property / cites work: Q4737516 / rank @@
+Normal rank
@@ Property / cites work @@
+A greedy algorithm for multicut and integral multiflow in rooted trees
+Normal rank
@@ Property / cites work @@
+Minimal multicut and maximal integer multiflow: a survey
+Normal rank
@@ Property / cites work @@
+Approximate max-integral-flow/min-multicut theorems
+Normal rank
@@ Property / cites work @@
+The geometry of graphs and some of its algorithmic applications
+Normal rank
@@ Property / cites work @@
+Q3789603
@@ Property / cites work: Q3789603 / rank @@
+Normal rank
@@ Property / cites work @@
+Super-connectivity and super-edge-connectivity for some interconnection networks
+Normal rank
@@ Property / cites work @@
+On the fault-tolerant diameter and wide diameter of ?-connected graphs
+Normal rank
@@ Property / cites work @@
+Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
+Normal rank
@@ Property / cites work @@
+Scattering number in graphs
@@ Property / cites work: Scattering number in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Relationships between scattering number and other vulnerability parameters
+Normal rank
@@ Property / cites work @@
+Q2744383
@@ Property / cites work: Q2744383 / rank @@
+Normal rank
@@ Property / cites work @@
+On the weak-integrity of graphs
@@ Property / cites work: On the weak-integrity of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+How the science of complex networks can help developing strategies against terrorism
+Normal rank
@@ Property / cites work @@
+Q3267900
@@ Property / cites work: Q3267900 / rank @@
+Normal rank
@@ Property / cites work @@
+Emergence of Scaling in Random Networks
@@ Property / cites work: Emergence of Scaling in Random Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Q4705070
@@ Property / cites work: Q4705070 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4875196
@@ Property / cites work: Q4875196 / rank @@
+Normal rank
@@ Property / cites work @@
+Vulnerability in graphs: the neighbour-integrity of line graphs
+Normal rank
@@ Property / cites work @@
+Q3840353
@@ Property / cites work: Q3840353 / rank @@
+Normal rank
@@ Property / cites work @@
+A branch-and-cut algorithm for the equicut problem
+Normal rank
@@ Property / cites work @@
+Q4254354
@@ Property / cites work: Q4254354 / rank @@
+Normal rank
@@ Property / cites work @@
+Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs
+Normal rank
@@ Property / cites work @@
+Random Sampling in Cut, Flow, and Network Design Problems
+Normal rank
@@ Property / cites work @@
+Finding optimal solutions to the graph partitioning problem with heuristic search
+Normal rank
@@ Property / cites work @@
+A new?old algorithm for minimum-cut and maximum-flow in closure graphs
+Normal rank
@@ Property / cites work @@
+Q4452912
@@ Property / cites work: Q4452912 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding <i>k</i> Cuts within Twice the Optimal
@@ Property / cites work: Finding <i>k</i> Cuts within Twice the Optimal / rank @@
+Normal rank
@@ Property / cites work @@
+An improved approximation algorithm of MULTIWAY CUT.
+Normal rank
@@ Property / cites work @@
+Evaluating network reliability and 2-edge-connected reliability in linear time for bounded pathwidth graphs
+Normal rank
@@ Property / cites work @@
+A sum of disjoint products algorithm for reliability evaluation of flow networks
+Normal rank
@@ Property / cites work @@
+Stochastic Network Interdiction
@@ Property / cites work: Stochastic Network Interdiction / rank @@
+Normal rank
@@ Property / cites work @@
+The network inhibition problem
@@ Property / cites work: The network inhibition problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4452913
@@ Property / cites work: Q4452913 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4390413
@@ Property / cites work: Q4390413 / rank @@
+Normal rank
@@ Property / cites work @@
+The analysis of multiuser network systems under uncertainty. VII: The problem of standard vulnerability analysis of a multicommodity flow network
+Normal rank
@@ Property / cites work @@
+Q3996070
@@ Property / cites work: Q3996070 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4520904
@@ Property / cites work: Q4520904 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing All Small Cuts in an Undirected Network
@@ Property / cites work: Computing All Small Cuts in an Undirected Network / rank @@
+Normal rank
@@ Property / cites work @@
+Lexicographical problem of the analysis of the vulnerability of a multicommodity network
+Normal rank
@@ Property / cites work @@
+Q4147873
@@ Property / cites work: Q4147873 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4083324
@@ Property / cites work: Q4083324 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3856120
@@ Property / cites work: Q3856120 / rank @@
+Normal rank
@@ Property / cites work @@
+Formal Methods for Components and Objects
@@ Property / cites work: Formal Methods for Components and Objects / rank @@
+Normal rank
@@ Property / cites work @@
+Q4391178
@@ Property / cites work: Q4391178 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1951863