Login / Signup

Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams.

Sagar KaleSumedh Tirodkar
Published in: APPROX-RANDOM (2017)
Keyphrases
  • maximum matching
  • bipartite graph
  • stable set
  • graph model
  • data streams
  • real time
  • link prediction
  • graph structure
  • edge weights
  • np hard