Optimal popular matchings
From MaRDI portal
Publication:967372
DOI10.1016/j.dam.2009.06.004zbMath1213.05212WikidataQ62045786 ScholiaQ62045786MaRDI QIDQ967372
Meghana Nasre, Telikepalli Kavitha
Publication date: 28 April 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.06.004
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Finding and Recognizing Popular Coalition Structures, Popular Matchings with Two-Sided Preferences and One-Sided Ties, Popular Matchings: Structure and Algorithms, Popular Matchings with Ties and Matroid Constraints, POPULAR SPANNING TREES, Unnamed Item, Finding strongly popular \(b\)-matchings in bipartite graphs, The popular matching and condensation problems under matroid constraints, Bounded unpopularity matchings, Popular matchings in the weighted capacitated house allocation problem, Rank-maximal matchings -- structure and algorithms, Popularity at minimum cost, Finding popular branchings in vertex-weighted digraphs, Minimal envy and popular matchings, Popular and clan-popular \(b\)-matchings, Finding popular branchings in vertex-weighted directed graphs, The Generalized Popular Condensation Problem, Popular Matchings with Two-Sided Preferences and One-Sided Ties
Cites Work
