Login / Signup

Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs.

Samir DattaRaghav KulkarniAnish Mukherjee
Published in: MFCS (2016)
Keyphrases
  • space efficient
  • maximum matching
  • bipartite graph
  • data structure
  • bloom filter
  • data streams
  • sliding window
  • stable set
  • data sets
  • link prediction
  • linear space
  • complex networks