A weighted approach to the maximum cardinality bipartite matching problem with applications in geometric settings

DOI10.20382/JOCG.V11I2A8zbMath1462.68142arXiv1903.10445OpenAlexW2925146178MaRDI QIDQ5854565

Sharath Raghvendra, Nathaniel Adam Lahn

Publication date: 17 March 2021

Full work available at URL: https://arxiv.org/abs/1903.10445

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

This page was built for publication: A weighted approach to the maximum cardinality bipartite matching problem with applications in geometric settings