Stable matchings in trees

DOI10.1007/978-3-319-62389-4_41zbMath1434.68369OpenAlexW2740530611MaRDI QIDQ2412431

Shuichi Ueno, Satoshi Tayu

Publication date: 23 October 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-62389-4_41

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Signed and weighted graphs (05C22)

Related Items (1)

Pareto efficient matchings with pairwise preferences

This page was built for publication: Stable matchings in trees