• The complexity of expansion problems 

      Louis, Anand (Georgia Institute of Technology, 2014-06-26)
      Graph-partitioning problems are a central topic of research in the study of algorithms and complexity theory. They are of interest to theoreticians with connections to error correcting codes, sampling algorithms, metric ...