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

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Andreas Emil Feldmann' in GoogleThis author has not been identified. Look up 'Peter Widmayer' in Google

runs on WebDSL