An $$O(n^4)$$ O ( n 4 ) Time Algorithm to Compute the Bisection Width of Solid Grid Graphs
Crossref DOI link: https://doi.org/10.1007/s00453-014-9928-y
Published Online: 2014-08-14
Published Print: 2015-01
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Feldmann, Andreas Emil
Widmayer, Peter
Text and Data Mining valid from 2014-08-14