Login / Signup

Multi-Pass Graph Streaming Lower Bounds for Cycle Counting, MAX-CUT, Matching Size, and Other Problems.

Sepehr AssadiGillat KolRaghuvansh R. SaxenaHuacheng Yu
Published in: FOCS (2020)
Keyphrases
  • lower bound
  • graph matching
  • min sum
  • max cut
  • upper bound
  • planar graphs
  • optimization problems
  • np complete
  • random walk
  • np hard
  • graphical models
  • connected components
  • similarity metric
  • hard problems