Finding strongly popular \(b\)-matchings in bipartite graphs

DOI10.1016/j.endm.2017.07.030zbMath1379.05109OpenAlexW2743915648MaRDI QIDQ5915825

Tamás Király, Zsuzsa Mészáros-Karkus

Publication date: 18 January 2018

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2017.07.030

zbMATH Keywords

graph algorithms\(b\)-matchingpopular matchingstable marriage

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Finding and Recognizing Popular Coalition Structures ⋮ Two problems in max-size popular matchings

Cites Work

• Unnamed Item
• Relative complexity of checking and evaluating
• Popular edges and dominant matchings
• Popular matchings in the stable marriage problem
• Popular matchings with two-sided preference lists and matroid constraints
• Popularity in the generalized hospital residents setting
• Popular Matchings with Two-Sided Preferences and One-Sided Ties
• Popular Matchings in the Marriage and Roommates Problems
• An efficient algorithm for the “stable roommates” problem
• Popularity, Mixed Matchings, and Self-duality
• College Admissions and the Stability of Marriage

This page was built for publication: Finding strongly popular \(b\)-matchings in bipartite graphs