• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery.

Anand LouisRakesh Venkat
Published in: ICALP (2018)
Keyphrases
  • exact and approximate
  • random graphs
  • string matching
  • decision trees
  • computational complexity
  • optimization problems
  • data sets
  • learning algorithm
  • dynamic programming
  • level set