On the complexity of the multicut problem in bounded tree-width graphs and digraphs

From MaRDI portal

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=On_the_complexity_of_the_multicut_problem_in_bounded_tree-width_graphs_and_digraphs&oldid=65532771"