Matching Is as Easy as the Decision Problem, in the NC Model
From MaRDI portal
Publication:5875756
DOI10.4230/LIPIcs.ITCS.2020.54OpenAlexW3003639791MaRDI QIDQ5875756
Publication date: 3 February 2023
Full work available at URL: https://arxiv.org/abs/1901.10387
Related Items (3)
Priority-based bin packing with subset constraints ⋮ Maximum matching in almost linear time on graphs of bounded clique-width ⋮ A real polynomial for bipartite graph minimum weight perfect matchings
This page was built for publication: Matching Is as Easy as the Decision Problem, in the NC Model
