Near-Popular Matchings in the Roommates Problem
From MaRDI portal
Publication:5300479
DOI10.1137/110852838zbMath1267.68166MaRDI QIDQ5300479
Chien-Chung Huang, Telikepalli Kavitha
Publication date: 27 June 2013
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/32fbf037d8f7ce2ae711909928eb3cfaa2f0bd5a
68R10: Graph theory (including graph drawing) in computer science
Related Items
Quasi-Popular Matchings, Optimality, and Extended Formulations, Popular Matchings in Complete Graphs, Finding strongly popular \(b\)-matchings in bipartite graphs, Popular matchings in complete graphs, The Generalized Popular Condensation Problem, Maintaining Near-Popular Matchings