Pages that link to "Item:Q3490035"
From MaRDI portal
The following pages link to On the Structure of Minimum-Weight <i>k</i>-Connected Spanning Networks (Q3490035):
Displaying 13 items.
- Minimum-weight two-connected spanning networks (Q582215) (← links)
- On shredders and vertex connectivity augmentation (Q924546) (← links)
- The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points. (Q1430376) (← links)
- On shortest three-edge-connected Steiner networks with Euclidean distance (Q1570830) (← links)
- Edge-disjoint minimum-weight connected spanning \(k\)-edge subgraphs in a weighted graph: A connectedness theorem (Q1584336) (← links)
- On the minimum-cost \(\lambda\)-edge-connected \(k\)-subgraph problem (Q1789587) (← links)
- Property testing on \(k\)-vertex-connectivity of graphs (Q2428696) (← links)
- \(k\)-edge connected polyhedra on series-parallel graphs (Q2564304) (← links)
- Minimum cost \(\leq k\) edges connected subgraph problems (Q2883545) (← links)
- A branch-and-cut algorithm for the k-edge connected subgraph problem (Q3057129) (← links)
- On the Steiner 2-edge connected subgraph polytope (Q3598034) (← links)
- Extremal graphs in connectivity augmentation (Q4256090) (← links)
- Node-weighted Network Design in Planar and Minor-closed Families of Graphs (Q5032022) (← links)
