Pages that link to "Item:Q2768327"
From MaRDI portal
The following pages link to Approximating the minimum strongly connected subgraph via a matching lower bound (Q2768327):
Displaying 24 items.
- An algorithmic metatheorem for directed treewidth (Q266806) (← links)
- Directed hypergraphs: introduction and fundamental algorithms -- a survey (Q507517) (← links)
- Dual-based approximation algorithms for cut-based network connectivity problems (Q722530) (← links)
- Minmax strongly connected subgraphs with node penalties (Q930773) (← links)
- The minimum spanning strong subdigraph problem is fixed parameter tractable (Q1005234) (← links)
- A linear time \(\frac{5}{3}\)-approximation for the minimum strongly-connected spanning subgraph problem (Q1007574) (← links)
- Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs (Q1045053) (← links)
- Every strong digraph has a spanning strong subgraph with at most \(n+2\alpha-2\) arcs (Q1405121) (← links)
- Sparse certificates for 2-connectivity in directed graphs (Q1676306) (← links)
- Dual power assignment via second Hamiltonian cycle (Q1686228) (← links)
- On strongly connected digraphs with bounded cycle length (Q1923587) (← links)
- A \(4+\epsilon\) approximation for \(k\)-connected subgraphs (Q2237891) (← links)
- Approximation algorithms for constructing some required structures in digraphs (Q2255946) (← 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)
- The minimum spanning strong subdigraph problem for extended semicomplete digraphs and semicomplete bipartite digraphs (Q2765953) (← links)
- Strongly Connected Spanning Subgraph for Almost Symmetric Networks (Q3132920) (← links)
- Approximating Transitive Reductions for Directed Networks (Q3183442) (← links)
- Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs (Q3452820) (← links)
- An efficiently solvable case of the minimum weight equivalent subgraph problem (Q3706869) (← links)
- Approximating Minimum-Size <i>k</i>-Connected Spanning Subgraphs via Matching (Q4507363) (← links)
- Sparse Highly Connected Spanning Subgraphs in Dense Directed Graphs (Q5222543) (← links)
- 1.61-approximation for min-power strong connectivity with two power levels (Q5963620) (← links)
- Finding strong components using depth-first search (Q6563999) (← links)
