An /mathcal{O}(n^4) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs

Andreas Emil Feldmann, Peter Widmayer. An /mathcal{O}(n^4) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs. In Camil Demetrescu, Magnús M. Halldórsson, editors, Algorithms - ESA 2011 - 19th Annual European Symposium, Saarbrücken, Germany, September 5-9, 2011. Proceedings. Volume 6942 of Lecture Notes in Computer Science, pages 143-154, Springer, 2011. [doi]

Abstract

Abstract is missing.