Pith. sign in

We investigate the numerical stability of this case

In which case the power method gives a good approximation

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

1 Pith paper citing it
browse 1 citing papers

fields

cs.DS 1

years

2025 1

verdicts

CONDITIONAL 1

representative citing papers

Distributed Sparsest Cut via Eigenvalue Estimation

cs.DS · 2025-08-27 · conditional · novelty 7.0

A CONGEST algorithm estimates graph conductance to a sqrt(2.01) factor in O(log^2 n / phi) rounds by approximating Laplacian eigenvalues with the power method.

citing papers explorer

Showing 1 of 1 citing paper.

  • Distributed Sparsest Cut via Eigenvalue Estimation cs.DS · 2025-08-27 · conditional · none · ref 16

    A CONGEST algorithm estimates graph conductance to a sqrt(2.01) factor in O(log^2 n / phi) rounds by approximating Laplacian eigenvalues with the power method.