Pages that link to "Item:Q469635"
From MaRDI portal
The following pages link to Testing \(k\)-edge-connectivity of digraphs (Q469635):
Displaying 10 items.
- Testing the \((s,t)\) connectivity of graphs and digraphs (Q428880) (← links)
- Testing Eulerianity and connectivity in directed sparse graphs (Q653336) (← links)
- Directed \(s\)-\(t\) numberings, rubber bands, and testing digraph \(k\)-vertex connecitivity (Q1343167) (← links)
- On the characterization of 1-sided error strongly testable graph properties for bounded-degree graphs (Q2304167) (← links)
- Testing the supermodular-cut condition (Q2350909) (← links)
- Testing for edge terms is decidable (Q2351513) (← links)
- Property testing on \(k\)-vertex-connectivity of graphs (Q2428696) (← links)
- Testing st-Connectivity (Q3603479) (← links)
- Testing properties of directed graphs: acyclicity and connectivity* (Q4543627) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313038) (← links)