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):
Displayed 4 items.
- On computing the 2-vertex-connected components of directed graphs (Q266828) (← links)
- Sparse certificates for 2-connectivity in directed graphs (Q1676306) (← links)
- Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs (Q3452820) (← links)
- Computing the 2-blocks of directed graphs (Q5501861) (← links)
