Pages that link to "Item:Q1007574"
From MaRDI portal
The following pages link to A linear time \(\frac{5}{3}\)-approximation for the minimum strongly-connected spanning subgraph problem (Q1007574):
Displaying 8 items.
- On computing the 2-vertex-connected components of directed graphs (Q266828) (← links)
- Dual-based approximation algorithms for cut-based network connectivity problems (Q722530) (← links)
- Sparse certificates for 2-connectivity in directed graphs (Q1676306) (← links)
- Approximating the smallest 2-vertex connected spanning subgraph of a directed graph (Q2286744) (← links)
- An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph (Q2656340) (← links)
- Strongly Connected Spanning Subgraph for Almost Symmetric Networks (Q3132920) (← links)
- Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs (Q3452820) (← links)
- Computing the 2-blocks of directed graphs (Q5501861) (← links)
