Edge-Connectivity Augmentation with Partition Constraints
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1303570
- Edge-connectivity augmentation problems
- Edge connectivity augmentation in near-linear time
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- Successive edge-connectivity augmentation problems
- scientific article; zbMATH DE number 1372654
- Graph-Theoretic Concepts in Computer Science
- Edge-Connectivity Augmentation Preserving Simplicity
- Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation
- The bridge-connectivity augmentation problem with a partition constraint
Cited in
(22)- Successive edge-connectivity augmentation problems
- Distance and connectivity measures in permutation graphs
- Splitting off edges between two subsets preserving the edge-connectivity of the graph.
- Connectivity interdiction
- The \((2, k)\)-connectivity augmentation problem: algorithmic aspects
- On edge connectivity and parity factor
- Edge-splittings preserving local edge-connectivity of graphs
- Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph
- Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph
- Edge-connectivity augmentations of~graphs~and~hypergraphs
- scientific article; zbMATH DE number 1303570 (Why is no real title available?)
- Edge-connectivity of permutation hypergraphs
- Augmenting the edge-connectivity of a hypergraph by adding a multipartite graph
- A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case
- Bipartition constrained edge-splitting in directed graphs
- Augmenting the rigidity of a graph in \(\mathbb R^{2}\)
- Graph connectivity and its augmentation: Applications of MA orderings
- Feynman symmetries of the Martin and c₂ invariants of regular graphs
- \(\mathbb{Z}_3\)-connectivity of signed graphs with independence number at most two
- Smallest bipartite bridge-connectivity augmentation
- Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs
- The bridge-connectivity augmentation problem with a partition constraint
This page was built for publication: Edge-Connectivity Augmentation with Partition Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4255815)
