Edge-connectivity augmentation and network matrices
From MaRDI portal
Recommendations
- Two-Connected Augmentation Problems in Planar Graphs
- A minimum 3-connectivity augmentation of a graph
- A 1.5-approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
- Approximation Algorithms for Graph Augmentation
- Polynomial time algorithms for edge-connectivity augmentation of Hamiltonian paths
Cited in
(10)- Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks
- Maximum algebraic connectivity augmentation is NP-hard
- A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation
- scientific article; zbMATH DE number 1303570 (Why is no real title available?)
- Edge-Connectivity Augmentation with Partition Constraints
- Polynomial time algorithms for edge-connectivity augmentation of Hamiltonian paths
- NA-EDGE-CONNECTIVITY AUGMENTATION PROBLEMS BY ADDING EDGES(<Special Issue>Network Design, Control and Optimization)
- scientific article; zbMATH DE number 894719 (Why is no real title available?)
- Edge capacity augmentation problem on spanning trees in networks
- Local edge-connectivity augmentation in hypergraphs is NP-complete
This page was built for publication: Edge-connectivity augmentation and network matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710817)