Pages that link to "Item:Q1407835"
From MaRDI portal
The following pages link to \(k\)-vertex-connectivity minimum augmentation for undirected unweighted graphs. (Q1407835):
Displaying 14 items.
- Hardness of \(k\)-vertex-connected subgraph augmentation problem (Q604752) (← links)
- A smallest augmentation to 3-connect a graph (Q1813979) (← links)
- An optimal time algorithm for the k-vertex-connectivity unweighted augmentation problem for rooted directed trees (Q1821118) (← links)
- On the optimal vertex-connectivity augmentation (Q1892828) (← links)
- The \((2, k)\)-connectivity augmentation problem: algorithmic aspects (Q2041970) (← links)
- Connectivity augmentation of graphs (Q2816106) (← links)
- An algorithm for construction of ak-connected graph with minimum number of edges and quasiminimal diameter (Q3338283) (← links)
- Minimum augmentation of a tree to a K-edge-connected graph (Q3783316) (← links)
- The minimum augmentation of any graph to aK-edge-connected graph (Q3825104) (← links)
- Augmenting Graphs to Meet Edge-Connectivity Requirements (Q3989009) (← links)
- Augmenting Edge-Connectivity over the Entire Range inÕ(nm) Time (Q4238530) (← links)
- (Q4474082) (← links)
- On Four-Connecting a Triconnected Graph (Q4485192) (← links)
- Undirected vertex-connectivity structure and smallest four-vertex-connectivity augmentation (extended abstract) (Q6487973) (← links)