Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector

From MaRDI portal

(Redirected from Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector)

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=Inverse_max_%2B_sum_spanning_tree_problem_under_Hamming_distance_by_modifying_the_sum-cost_vector&oldid=70791798"