Algorithms for maximum internal spanning tree problem for some graph classes

From MaRDI portal

(Redirected from Algorithms for maximum internal spanning tree problem for some graph classes)

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=Algorithms_for_maximum_internal_spanning_tree_problem_for_some_graph_classes&oldid=71318790"