Defines the memory-bounded μ-CONGEST model and establishes a tight Θ(n^{1+o(1)}/μ^{1/2}) round complexity for triangle listing, plus efficient streaming algorithm simulations.
Distributed MST and routing in almost mixing time
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Bounded Memory in Distributed Networks
Defines the memory-bounded μ-CONGEST model and establishes a tight Θ(n^{1+o(1)}/μ^{1/2}) round complexity for triangle listing, plus efficient streaming algorithm simulations.