A tight bound on the min-ratio edge-partitioning problem of a tree

From MaRDI portal

(Redirected from A tight bound on the min-ratio edge-partitioning problem of a tree)

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_tight_bound_on_the_min-ratio_edge-partitioning_problem_of_a_tree&oldid=63266157"