Pages that link to "Item:Q3767103"
From MaRDI portal
The following pages link to Optimal attack and reinforcement of a network (Q3767103):
Displaying 50 items.
- Hypergraphic submodular function minimization (Q393937) (← links)
- Edge-disjoint spanning trees and eigenvalues of regular graphs (Q426054) (← links)
- A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees (Q433082) (← links)
- Characterizations of strength extremal graphs (Q489310) (← links)
- Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs (Q492813) (← links)
- Optimal design and defense of networks under link attacks (Q502337) (← links)
- Security games on matroids (Q507326) (← links)
- A proof of the molecular conjecture (Q540449) (← links)
- Approximation algorithms for \(k\)-hurdle problems (Q627530) (← links)
- Degree sequences and graphs with disjoint spanning trees (Q642969) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid (Q714036) (← links)
- Minimum cost subpartitions in graphs (Q845968) (← links)
- A faster algorithm for computing the principal sequence of partitions of a graph (Q848839) (← links)
- Design of survivable IP-over-optical networks (Q863570) (← links)
- Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure (Q947931) (← links)
- Polarity and the complexity of the shooting experiment (Q951126) (← links)
- Brick partitions of graphs (Q960924) (← links)
- A fast exact algorithm for the problem of optimum cooperation and the structure of its solutions (Q975757) (← links)
- Transforming a graph into a 1-balanced graph (Q1003673) (← links)
- A new algorithm for the intersection of a line with the independent set polytope of a matroid (Q1004529) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- Transitions in geometric minimum spanning trees (Q1199130) (← links)
- Separating from the dominant of the spanning tree polytope (Q1200792) (← links)
- Fractional arboricity, strength, and principal partitions in graphs and matroids (Q1208447) (← links)
- Minimizing symmetric submodular functions (Q1290631) (← links)
- A faster algorithm for computing the strength of a network (Q1318743) (← links)
- Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness (Q1602687) (← links)
- A note on optimal covering augmentation for graphic polymatroids. (Q1603399) (← links)
- Fast approximation of matroid packing and covering (Q1730564) (← links)
- A kind of conditional connectivity of Cayley graphs generated by wheel graphs (Q1735259) (← links)
- Greedy splitting algorithms for approximating multiway partition problems (Q1769071) (← links)
- Computing the binding number of a graph (Q1813976) (← links)
- Separation of partition inequalities for the \((1,2)\)-survivable network design problem (Q1866009) (← links)
- Strength of a graph and packing of trees and branchings (Q1895050) (← links)
- Strength and fractional arboricity of complementary graphs (Q1897432) (← links)
- Optimization of computations (Q1905130) (← links)
- On two-connected subgraph polytopes (Q1910503) (← links)
- Games induced by the partitioning of a graph (Q1945082) (← links)
- On the \(k\)-cut problem (Q1977642) (← links)
- On some algorithmic aspects of hypergraphic matroids (Q2099466) (← links)
- New polyhedral and algorithmic results on greedoids (Q2220660) (← links)
- Network strength games: the core and the nucleolus (Q2297643) (← links)
- Spanning tree packing number and eigenvalues of graphs with given girth (Q2321370) (← links)
- Degree sequence realizations with given packing and covering of spanning trees (Q2341721) (← links)
- Edge vulnerability parameters of split graphs (Q2371083) (← links)
- Separation of partition inequalities with terminals (Q2386198) (← links)
- Hitting a path: a generalization of weighted connectivity via game theory (Q2424795) (← links)
- Approximating \(k\)-cuts using network strength as a Lagrangean relaxation (Q2462107) (← links)
- \(k\)-edge connected polyhedra on series-parallel graphs (Q2564304) (← links)
