Pages that link to "Item:Q1426722"
From MaRDI portal
The following pages link to Finding 2-edge connected spanning subgraphs. (Q1426722):
Displaying 7 items.
- A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs (Q284336) (← links)
- A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations and obliged edges (Q298954) (← links)
- More routes for evacuation (Q1790955) (← links)
- Approximating the smallest 2-vertex connected spanning subgraph of a directed graph (Q2286744) (← links)
- Improving on the 1. 5-approximation of a smallest 2-edge connected spanning subgraph (Q2706198) (← links)
- On Finding Minimal Two-Connected Subgraphs (Q4327813) (← links)
- A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem (Q4973051) (← links)