Popular and Clan-Popular b-Matchings
From MaRDI portal
Publication:4909528
DOI10.1007/978-3-642-35261-4_15zbMath1260.91165OpenAlexW21866506MaRDI QIDQ4909528
Publication date: 21 March 2013
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-35261-4_15
Nonnumerical algorithms (68W05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Matching models (91B68)
Related Items (1)
This page was built for publication: Popular and Clan-Popular b-Matchings
