Testing st-Connectivity

DOI10.1007/978-3-540-74208-1_28zbMath1171.68597OpenAlexW1880824757MaRDI QIDQ3603479

Eldar Fischer, Ilan Newman, Sourav Chakraborty, Arie Matsliah, Oded Lachish

Publication date: 17 February 2009

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74208-1_28

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)

Related Items (6)

Testing whether the uniform distribution is a stationary distribution ⋮ Testing list \(H\)-homomorphisms ⋮ An Algebraic Characterization of Testable Boolean CSPs ⋮ On the Query Complexity of Testing Orientations for Being Eulerian ⋮ Testing convexity properties of tree colorings ⋮ Property Testing of Massively Parametrized Problems – A Survey

This page was built for publication: Testing st-Connectivity