Login / Signup

When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time.

Sepehr AssadiShay Solomon
Published in: ICALP (2019)
Keyphrases
  • independent set
  • maximum weight
  • learning algorithm
  • graph matching
  • computational complexity
  • supervised learning
  • worst case
  • pattern matching
  • matching algorithm
  • image matching
  • bipartite graph
  • maximum independent set