Pages that link to "Item:Q1406041"
From MaRDI portal
The following pages link to On the minimum local-vertex-connectivity augmentation in graphs (Q1406041):
Displaying 8 items.
- Augmenting graphs to minimize the diameter (Q494792) (← links)
- Hardness of \(k\)-vertex-connected subgraph augmentation problem (Q604752) (← links)
- Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs (Q860392) (← links)
- Tight approximation algorithm for connectivity augmentation problems (Q931712) (← links)
- Local edge-connectivity augmentation in hypergraphs is NP-complete (Q968204) (← links)
- (Q4474082) (← links)
- Preserving and Increasing Local Edge-Connectivity in Mixed Graphs (Q4837644) (← links)
- A <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mn>4</mml:mn><mml:mo stretchy="false">/</mml:mo><mml:mn>3</mml:mn></mml:math>-approximation for the minimum 2-local-vertex-connectivity augmentation in a co (Q5692272) (← links)