Pages that link to "Item:Q1892828"
From MaRDI portal
The following pages link to On the optimal vertex-connectivity augmentation (Q1892828):
Displaying 29 items.
- Approximating minimum-cost edge-covers of crossing biset-families (Q397064) (← links)
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach (Q414633) (← links)
- An approximation algorithm for minimum-cost vertex-connectivity problems (Q679445) (← links)
- Graph connectivity and its augmentation: Applications of MA orderings (Q697579) (← links)
- On shredders and vertex connectivity augmentation (Q924546) (← links)
- Faster approximation algorithms for weighted triconnectivity augmentation problems (Q1267191) (← links)
- On the existence of \((k,l)\)-critical graphs (Q1377731) (← links)
- A note on the vertex-connectivity augmentation problem (Q1386437) (← links)
- Pushdown-reduce: An algorithm for connectivity augmentation and poset covering problems (Q1406022) (← links)
- Improved approximation algorithms for minimum cost node-connectivity augmentation problems (Q1635806) (← links)
- Independence free graphs and vertex connectivity augmentation (Q1775893) (← links)
- Approximating \(k\)-connected \(m\)-dominating sets (Q2144267) (← links)
- Critical node detection problem for complex network in undirected weighted networks (Q2164641) (← links)
- On the cycle augmentation problem: hardness and approximation algorithms (Q2230719) (← links)
- Algorithm and complexity of the two disjoint connected dominating sets problem on trees (Q2335669) (← links)
- Approximating subset \(k\)-connectivity problems (Q2376789) (← links)
- Property testing on \(k\)-vertex-connectivity of graphs (Q2428696) (← links)
- Approximating node-connectivity augmentation problems (Q2429349) (← links)
- Globally rigid augmentation of minimally rigid graphs in \(\mathbb{R}^2\) (Q2692732) (← links)
- Multigraph augmentation under biconnectivity and general edge-connectivity requirements (Q2719846) (← links)
- Extension to Even Triangulations (Q3449865) (← links)
- Extremal graphs in connectivity augmentation (Q4256090) (← links)
- Structured Connectivity Augmentation (Q4555048) (← links)
- Globally Rigid Augmentation of Rigid Graphs (Q5043054) (← links)
- How to make a strongly connected digraph two-connected (Q5101433) (← links)
- Structured Connectivity Augmentation (Q5111243) (← links)
- Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems (Q5740195) (← links)
- Approximating k-Connected m-Dominating Sets (Q5874545) (← links)
- Augmenting trees so that every three vertices lie on a cycle (Q5957303) (← links)