pith. sign in

Distributed Approximation of Maximum Independent Set and Maximum Matching , booktitle =

3 Pith papers cite this work. Polarity classification is still indexing.

3 Pith papers citing it

years

2026 3

verdicts

UNVERDICTED 3

clear filters

representative citing papers

Distributed Stochastic Graph Algorithms

cs.DS · 2026-05-20 · unverdicted · novelty 7.0

Introduces a distributed stochastic setting for graph optimization and supplies fast approximation algorithms for matching, vertex cover, and dominating set that surpass non-stochastic lower bounds.

citing papers explorer

Showing 1 of 1 citing paper after filters.

  • Distributed Stochastic Graph Algorithms cs.DS · 2026-05-20 · unverdicted · none · ref 109

    Introduces a distributed stochastic setting for graph optimization and supplies fast approximation algorithms for matching, vertex cover, and dominating set that surpass non-stochastic lower bounds.