Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover

From MaRDI portal

(Redirected from Publication:3527209)

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_Algorithms_for_Maximum_Subset_Matching_and_All-Pairs_Shortest_Paths_in_Graphs_with_a_(Not_So)_Small_Vertex_Cover&oldid=80648030"