Popular and Clan-Popular b-Matchings

DOI10.1007/978-3-642-35261-4_15zbMATH Open1260.91165OpenAlexW21866506MaRDI QIDQ4909528FDOQ4909528

Authors: Katarzyna Paluch 

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

Recommendations

• Popular and clan-popular \(b\)-matchings
• Popular matchings: structure and algorithms
• Popular Matchings: Structure and Algorithms
• Popular matchings
• Popular Matchings
• Popular matchings in complete graphs
• Popular Matchings in Complete Graphs
• Optimal popular matchings
• Popular matchings with ties and matroid constraints
• Popular matchings and limits to tractability

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Nonnumerical algorithms (68W05) Matching models (91B68)

Cited In (3)

• The generalized popular condensation problem
• Popular and clan-popular \(b\)-matchings
• Popular matchings in the weighted capacitated house allocation problem

This page was built for publication: Popular and Clan-Popular b-Matchings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4909528)