An \(O(n^4)\) time algorithm to compute the bisection width of solid grid graphs

From MaRDI portal

(Redirected from An O(n^4) time algorithm to compute the bisection width of solid grid graphs)
An \(O(n^4)\) time algorithm to compute the bisection width of solid grid graphs

Jump to:navigation, search

WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=An_%5C(O(n%5E4)%5C)_time_algorithm_to_compute_the_bisection_width_of_solid_grid_graphs&oldid=71700327"