A linear time algorithm for a variant of the MAX CUT problem in series parallel graphs

From MaRDI portal

(Redirected from A linear time algorithm for a variant of the MAX CUT problem in series parallel 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=A_linear_time_algorithm_for_a_variant_of_the_MAX_CUT_problem_in_series_parallel_graphs&oldid=69127521"