Optimal attack and reinforcement of a network
From MaRDI portal
Publication:3767103
Recommendations
Cited in
(only showing first 100 items - show all)- Transforming a graph into a 1-balanced graph
- A new algorithm for the intersection of a line with the independent set polytope of a matroid
- Generalized polymatroids and submodular flows
- Transitions in geometric minimum spanning trees
- Separating from the dominant of the spanning tree polytope
- Fractional arboricity, strength, and principal partitions in graphs and matroids
- Minimizing symmetric submodular functions
- A faster algorithm for computing the strength of a network
- Fast on-line/off-line algorithms for optimal reinforcement of a network and its connections with principal partition
- Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness
- A note on optimal covering augmentation for graphic polymatroids.
- Tabu search enhances network robustness under targeted attacks
- Fast approximation of matroid packing and covering
- A kind of conditional connectivity of Cayley graphs generated by wheel graphs
- Greedy splitting algorithms for approximating multiway partition problems
- Computing the binding number of a graph
- Separation of partition inequalities for the \((1,2)\)-survivable network design problem
- Strength of a graph and packing of trees and branchings
- Strength and fractional arboricity of complementary graphs
- Optimization of computations
- On two-connected subgraph polytopes
- Games induced by the partitioning of a graph
- On the \(k\)-cut problem
- Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks
- On some algorithmic aspects of hypergraphic matroids
- New polyhedral and algorithmic results on greedoids
- Measuring the robustness of a network using minimal vertex covers
- Cut-threshold graphs
- Network strength games: the core and the nucleolus
- Spanning tree packing number and eigenvalues of graphs with given girth
- Degree sequence realizations with given packing and covering of spanning trees
- Edge vulnerability parameters of split graphs
- Separation of partition inequalities with terminals
- Hitting a path: a generalization of weighted connectivity via game theory
- Approximating \(k\)-cuts using network strength as a Lagrangean relaxation
- k-edge connected polyhedra on series-parallel graphs
- Network reinforcement
- Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
- A new-old algorithm for minimum-cut and maximum-flow in closure graphs.
- Game-theoretic robustness of many-to-one networks
- Minimizing expected attacking cost in networks
- Modelling and simulations for DDoS attacks mitigation in identifier-locator split network
- Strategic network formation with attack and immunization
- Theory of principal partitions revisited
- Graphic submodular function minimization: a graphic approach and applications
- Packing the Steiner trees of a graph
- Network Elicitation in Adversarial Environment
- LP relaxation and tree packing for minimum k-cut
- A linear programming approach to increasing the weight of all minimum spanning trees
- Two-Server Network Disconnection Problem
- Packing and covering with integral feasible flows in integral supply-demand networks
- Hypergraphic submodular function minimization
- Strength and reinforcement of a network and tree packing
- Edge-disjoint spanning trees and eigenvalues of regular graphs
- A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees
- scientific article; zbMATH DE number 2080194 (Why is no real title available?)
- Computing weighted strength and applications to partitioning
- On minimum 3-cuts and approximating k-cuts using cut trees
- Small Submatroids in Random Matroids
- Characterizations of strength extremal graphs
- Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs
- Optimal serverless networks attacks, complexity and some approximate algorithms
- Network topology vulnerability/cost trade-off: model, application, and computational complexity
- How Do You Defend a Network?
- Optimal design and defense of networks under link attacks
- Security games on matroids
- A brief account on the development and future research directions of connectivity properties of interconnection networks
- Generalized max flows and augmenting paths
- Optimizing Attack Schedules Based on Energy Dispatch Over Two-Hop Relay Networks
- Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees
- Network disconnection problems in a centralized network
- A proof of the molecular conjecture
- Approximation Algorithms for k-Hurdle Problems
- scientific article; zbMATH DE number 2230273 (Why is no real title available?)
- Non-preemptive tree packing
- Non-preemptive tree packing
- Optimal hierarchical clustering on a graph
- Spectral radius and edge‐disjoint spanning trees
- Spanning tree modulus for secure broadcast games
- Supereulerian regular matroids without small cocircuits
- Graph rigidity properties of Ramanujan graphs
- Risk‐averse optimization and resilient network flows
- Approximation algorithms for \(k\)-hurdle problems
- Degree sequences and graphs with disjoint spanning trees
- Modifying networks to obtain low cost trees
- Spanning trees: A survey
- Approximating submodular \(k\)-partition via principal partition sequence
- Design of survivable networks with low connectivity requirements
- Efficient best response computation for strategic network formation under attack
- Uniform density in matroids, matrices and graphs
- Finding the maximum subgraph of prescribed strength
- Destroying densest subgraphs is hard
- Edge-disjoint spanning trees and balloons in (multi-)graphs from size or spectral radius
- An exact-arithmetic algorithm for spanning tree modulus
- Destroying densest subgraphs is hard
- An algorithm for packing hypertrees
- Modulus for bases of matroids
- Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid
- Eigenvalues and factors: a survey
- On deleting vertices to reduce density in graphs and supermodular functions
This page was built for publication: Optimal attack and reinforcement of a network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3767103)
