Pages that link to "Item:Q284336"
From MaRDI portal
The following pages link to A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs (Q284336):
Displaying 4 items.
- A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations and obliged edges (Q298954) (← links)
- Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs (Q1751242) (← links)
- Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes (Q2067494) (← links)
- A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem (Q2680988) (← links)