Fast distributed approximation algorithm for the maximum matching problem in bounded arboricity graphs

From MaRDI portal

(Redirected from Fast distributed approximation algorithm for the maximum matching problem in bounded arboricity graphs)

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=Fast_distributed_approximation_algorithm_for_the_maximum_matching_problem_in_bounded_arboricity_graphs&oldid=81018635"