The Weighted Matching Approach to Maximum Cardinality Matching
From MaRDI portal
Publication:4601124
DOI10.3233/FI-2017-1555zbMath1387.68316arXiv1703.03998MaRDI QIDQ4601124
Publication date: 19 January 2018
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.03998
Analysis of algorithms (68W40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (4)
A query-efficient quantum algorithm for maximum matching on general graphs ⋮ Blocking trails for \(f\)-factors of multigraphs ⋮ A weight-scaling algorithm for \(f\)-factors of multigraphs ⋮ Unnamed Item
This page was built for publication: The Weighted Matching Approach to Maximum Cardinality Matching
