Pith. sign in

arXiv preprint arXiv:2502.18382 , year=

Property Testing in Bounded Degree Hypergraphs , author= · arXiv 2502.18382

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
read on arXiv browse 1 citing papers

fields

cs.DS 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Testing Bipartiteness in Logarithmic Rounds

cs.DS · 2026-06-11 · unverdicted · novelty 5.0

Bipartiteness of bounded-degree graphs can be tested with O(√n) random walks of length O(log n) via SDP relaxation, yielding an optimal O(log n)-pass streaming algorithm.

citing papers explorer

Showing 1 of 1 citing paper.

  • Testing Bipartiteness in Logarithmic Rounds cs.DS · 2026-06-11 · unverdicted · none · ref 1

    Bipartiteness of bounded-degree graphs can be tested with O(√n) random walks of length O(log n) via SDP relaxation, yielding an optimal O(log n)-pass streaming algorithm.