Pages that link to "Item:Q1910503"
From MaRDI portal
The following pages link to On two-connected subgraph polytopes (Q1910503):
Displaying 28 items.
- The \(k\) edge-disjoint 3-hop-constrained paths polytope (Q429666) (← links)
- Polyhedral study of the connected subgraph problem (Q468440) (← links)
- Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron (Q839668) (← links)
- Design of survivable IP-over-optical networks (Q863570) (← links)
- On the linear relaxation of the 2-node connected subgraph polytope (Q1302172) (← links)
- Two-edge connected spanning subgraphs and polyhedra (Q1330901) (← links)
- On perfectly two-edge connected graphs (Q1363658) (← links)
- On finding two-connected subgraphs in planar graphs (Q1376267) (← links)
- The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points. (Q1430376) (← links)
- On imposing connectivity constraints in integer programs (Q1683690) (← links)
- On survivable network polyhedra (Q1772416) (← links)
- Encoding and avoiding 2-connected patterns in polygon dissections and outerplanar graphs (Q1800412) (← links)
- The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs (Q1917298) (← links)
- Polyhedron of triangle-free simple 2-matchings in subcubic graphs (Q1949271) (← links)
- The node-edge weighted 2-edge connected subgraph problem: linear relaxation, facets and separation (Q2506819) (← links)
- \(k\)-edge connected polyhedra on series-parallel graphs (Q2564304) (← links)
- The 2-edge-connected subgraph polyhedron (Q2576774) (← links)
- Critical extreme points of the 2-edge connected spanning subgraph polytope (Q2583127) (← links)
- Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut (Q2583145) (← links)
- Box-total dual integrality and edge-connectivity (Q2689821) (← links)
- On Steiner 2-edge connected polytopes (Q2816114) (← links)
- Connecting Terminals and 2-Disjoint Connected Subgraphs (Q2864321) (← links)
- Survivability in hierarchical telecommunications networks (Q2892145) (← 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)
- Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems (Q4018843) (← links)
- Linear‐time algorithms for the 2‐connected steiner subgraph problem on special classes of graphs (Q5287453) (← links)
- On the dominant of the Steiner 2-edge connected subgraph polytope (Q5946813) (← links)
