A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem

From MaRDI portal

(Redirected from A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem)

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_parallel_hybrid_greedy_branch_and_bound_scheme_for_the_maximum_distance-2_matching_problem&oldid=61060887"