Pages that link to "Item:Q653336"
From MaRDI portal
The following pages link to Testing Eulerianity and connectivity in directed sparse graphs (Q653336):
Displaying 10 items.
- Testing whether the uniform distribution is a stationary distribution (Q269729) (← links)
- Testing the \((s,t)\) connectivity of graphs and digraphs (Q428880) (← links)
- Distribution-free connectivity testing for sparse graphs (Q926283) (← links)
- Dynamic graph stream algorithms in \(o(n)\) space (Q1741857) (← 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)
- Property testing on \(k\)-vertex-connectivity of graphs (Q2428696) (← links)
- Testing the diameter of graphs (Q4543626) (← links)
- Testing properties of directed graphs: acyclicity and connectivity* (Q4543627) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313038) (← links)